./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.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_codestructure_steplocals_file-74.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 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:58:28,667 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:58:28,708 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 08:58:28,713 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:58:28,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:58:28,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:58:28,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:58:28,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:58:28,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:58:28,731 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:58:28,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:58:28,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:58:28,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:58:28,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:58:28,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:58:28,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:58:28,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:58:28,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:58:28,733 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:58:28,733 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 -> 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 [2025-01-09 08:58:28,961 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:58:28,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:58:28,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:58:28,968 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:58:28,968 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:58:28,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2025-01-09 08:58:30,108 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99d24baa9/d1af5c1c302d4f56a0d74a0c88746c33/FLAG0b3ef27e8 [2025-01-09 08:58:30,342 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:58:30,342 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2025-01-09 08:58:30,358 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99d24baa9/d1af5c1c302d4f56a0d74a0c88746c33/FLAG0b3ef27e8 [2025-01-09 08:58:30,683 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99d24baa9/d1af5c1c302d4f56a0d74a0c88746c33 [2025-01-09 08:58:30,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:58:30,686 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:58:30,687 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:58:30,687 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:58:30,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:58:30,691 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,691 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552c6894 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30, skipping insertion in model container [2025-01-09 08:58:30,691 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:58:30,797 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_codestructure_steplocals_file-74.i[917,930] [2025-01-09 08:58:30,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:58:30,847 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:58:30,854 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_codestructure_steplocals_file-74.i[917,930] [2025-01-09 08:58:30,869 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:58:30,879 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:58:30,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30 WrapperNode [2025-01-09 08:58:30,879 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:58:30,880 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:58:30,880 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:58:30,880 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:58:30,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,890 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,907 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 188 [2025-01-09 08:58:30,907 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:58:30,908 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:58:30,908 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:58:30,908 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:58:30,914 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,914 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,928 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 08:58:30,928 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,940 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:58:30,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:58:30,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:58:30,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:58:30,955 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (1/1) ... [2025-01-09 08:58:30,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:58:30,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:58:30,981 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 08:58:30,984 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 08:58:31,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:58:31,000 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:58:31,000 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:58:31,000 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:58:31,000 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:58:31,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:58:31,057 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:58:31,059 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:58:31,335 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 08:58:31,335 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:58:31,345 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:58:31,346 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:58:31,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:58:31 BoogieIcfgContainer [2025-01-09 08:58:31,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:58:31,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:58:31,348 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:58:31,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:58:31,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:58:30" (1/3) ... [2025-01-09 08:58:31,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52594902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:58:31, skipping insertion in model container [2025-01-09 08:58:31,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:30" (2/3) ... [2025-01-09 08:58:31,354 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52594902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:58:31, skipping insertion in model container [2025-01-09 08:58:31,354 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:58:31" (3/3) ... [2025-01-09 08:58:31,355 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-74.i [2025-01-09 08:58:31,372 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:58:31,373 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-74.i that has 2 procedures, 86 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:58:31,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:58:31,435 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;@72eba8d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:58:31,436 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:58:31,439 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 56 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:58:31,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 08:58:31,449 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:58:31,449 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:31,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:58:31,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:58:31,453 INFO L85 PathProgramCache]: Analyzing trace with hash -977903190, now seen corresponding path program 1 times [2025-01-09 08:58:31,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:58:31,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339111143] [2025-01-09 08:58:31,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:31,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:58:31,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 08:58:31,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 08:58:31,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:31,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:58:31,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 08:58:31,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:58:31,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339111143] [2025-01-09 08:58:31,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339111143] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:58:31,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460741883] [2025-01-09 08:58:31,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:31,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:58:31,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:58:31,723 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 08:58:31,726 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 08:58:31,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 08:58:31,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 08:58:31,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:31,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:58:31,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:58:31,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:58:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-01-09 08:58:31,917 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:58:31,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460741883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:58:31,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:58:31,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:58:31,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030785056] [2025-01-09 08:58:31,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:58:31,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:58:31,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:58:31,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:58:31,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:58:31,940 INFO L87 Difference]: Start difference. First operand has 86 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 56 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 08:58:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:58:31,964 INFO L93 Difference]: Finished difference Result 166 states and 283 transitions. [2025-01-09 08:58:31,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:58:31,966 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2025-01-09 08:58:31,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:58:31,993 INFO L225 Difference]: With dead ends: 166 [2025-01-09 08:58:31,993 INFO L226 Difference]: Without dead ends: 83 [2025-01-09 08:58:31,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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 08:58:31,997 INFO L435 NwaCegarLoop]: 125 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, 125 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 08:58:31,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:58:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-01-09 08:58:32,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-01-09 08:58:32,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.3018867924528301) internal successors, (69), 53 states have internal predecessors, (69), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:58:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 125 transitions. [2025-01-09 08:58:32,022 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 125 transitions. Word has length 178 [2025-01-09 08:58:32,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:58:32,022 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 125 transitions. [2025-01-09 08:58:32,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 08:58:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 125 transitions. [2025-01-09 08:58:32,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 08:58:32,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:58:32,025 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:32,034 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 08:58:32,229 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 08:58:32,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:58:32,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:58:32,230 INFO L85 PathProgramCache]: Analyzing trace with hash -686814370, now seen corresponding path program 1 times [2025-01-09 08:58:32,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:58:32,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237485270] [2025-01-09 08:58:32,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:32,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:58:32,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 08:58:32,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 08:58:32,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:32,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:58:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 08:58:32,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:58:32,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237485270] [2025-01-09 08:58:32,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237485270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:58:32,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:58:32,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:58:32,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852397258] [2025-01-09 08:58:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:58:32,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:58:32,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:58:32,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:58:32,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:58:32,481 INFO L87 Difference]: Start difference. First operand 83 states and 125 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:58:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:58:32,523 INFO L93 Difference]: Finished difference Result 206 states and 308 transitions. [2025-01-09 08:58:32,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:58:32,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-01-09 08:58:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:58:32,526 INFO L225 Difference]: With dead ends: 206 [2025-01-09 08:58:32,526 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 08:58:32,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:58:32,528 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 61 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:58:32,528 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 235 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:58:32,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 08:58:32,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2025-01-09 08:58:32,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 79 states have internal predecessors, (99), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 08:58:32,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 183 transitions. [2025-01-09 08:58:32,552 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 183 transitions. Word has length 178 [2025-01-09 08:58:32,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:58:32,554 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 183 transitions. [2025-01-09 08:58:32,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:58:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 183 transitions. [2025-01-09 08:58:32,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 08:58:32,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:58:32,560 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:32,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:58:32,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:58:32,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:58:32,561 INFO L85 PathProgramCache]: Analyzing trace with hash -6756000, now seen corresponding path program 1 times [2025-01-09 08:58:32,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:58:32,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416398046] [2025-01-09 08:58:32,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:32,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:58:32,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 08:58:32,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 08:58:32,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:32,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:58:33,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 08:58:33,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:58:33,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416398046] [2025-01-09 08:58:33,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416398046] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:58:33,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:58:33,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 08:58:33,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567704040] [2025-01-09 08:58:33,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:58:33,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 08:58:33,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:58:33,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 08:58:33,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 08:58:33,394 INFO L87 Difference]: Start difference. First operand 123 states and 183 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:58:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:58:33,526 INFO L93 Difference]: Finished difference Result 288 states and 426 transitions. [2025-01-09 08:58:33,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 08:58:33,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2025-01-09 08:58:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:58:33,530 INFO L225 Difference]: With dead ends: 288 [2025-01-09 08:58:33,530 INFO L226 Difference]: Without dead ends: 168 [2025-01-09 08:58:33,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:58:33,531 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 31 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:58:33,534 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 338 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:58:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-01-09 08:58:33,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 144. [2025-01-09 08:58:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 100 states have internal predecessors, (131), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 08:58:33,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 215 transitions. [2025-01-09 08:58:33,553 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 215 transitions. Word has length 178 [2025-01-09 08:58:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:58:33,554 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 215 transitions. [2025-01-09 08:58:33,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:58:33,554 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 215 transitions. [2025-01-09 08:58:33,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 08:58:33,555 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:58:33,556 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:33,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 08:58:33,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:58:33,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:58:33,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1822933422, now seen corresponding path program 1 times [2025-01-09 08:58:33,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:58:33,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228527982] [2025-01-09 08:58:33,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:33,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:58:33,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 08:58:33,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 08:58:33,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:33,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:58:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 08:58:34,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:58:34,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228527982] [2025-01-09 08:58:34,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228527982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:58:34,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:58:34,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:58:34,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672088814] [2025-01-09 08:58:34,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:58:34,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:58:34,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:58:34,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:58:34,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:58:34,116 INFO L87 Difference]: Start difference. First operand 144 states and 215 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:58:34,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:58:34,237 INFO L93 Difference]: Finished difference Result 354 states and 519 transitions. [2025-01-09 08:58:34,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 08:58:34,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-01-09 08:58:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:58:34,240 INFO L225 Difference]: With dead ends: 354 [2025-01-09 08:58:34,240 INFO L226 Difference]: Without dead ends: 213 [2025-01-09 08:58:34,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:58:34,241 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 97 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:58:34,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 429 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:58:34,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-01-09 08:58:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 144. [2025-01-09 08:58:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.3232323232323233) internal successors, (131), 100 states have internal predecessors, (131), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 08:58:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 215 transitions. [2025-01-09 08:58:34,254 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 215 transitions. Word has length 179 [2025-01-09 08:58:34,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:58:34,255 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 215 transitions. [2025-01-09 08:58:34,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:58:34,255 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 215 transitions. [2025-01-09 08:58:34,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-01-09 08:58:34,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:58:34,256 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:34,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:58:34,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:58:34,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:58:34,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1450965520, now seen corresponding path program 1 times [2025-01-09 08:58:34,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:58:34,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115199541] [2025-01-09 08:58:34,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:34,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:58:34,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 08:58:34,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 08:58:34,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:34,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:58:34,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-01-09 08:58:34,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:58:34,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115199541] [2025-01-09 08:58:34,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115199541] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:58:34,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:58:34,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 08:58:34,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589010105] [2025-01-09 08:58:34,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:58:34,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:58:34,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:58:34,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:58:34,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 08:58:34,956 INFO L87 Difference]: Start difference. First operand 144 states and 215 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:58:35,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:58:35,181 INFO L93 Difference]: Finished difference Result 332 states and 490 transitions. [2025-01-09 08:58:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 08:58:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2025-01-09 08:58:35,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:58:35,184 INFO L225 Difference]: With dead ends: 332 [2025-01-09 08:58:35,184 INFO L226 Difference]: Without dead ends: 191 [2025-01-09 08:58:35,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:58:35,185 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 73 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 08:58:35,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 399 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 08:58:35,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-01-09 08:58:35,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 123. [2025-01-09 08:58:35,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 79 states have internal predecessors, (97), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 08:58:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2025-01-09 08:58:35,197 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 179 [2025-01-09 08:58:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:58:35,197 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2025-01-09 08:58:35,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 08:58:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2025-01-09 08:58:35,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-09 08:58:35,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:58:35,199 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:35,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 08:58:35,199 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:58:35,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:58:35,200 INFO L85 PathProgramCache]: Analyzing trace with hash -282706767, now seen corresponding path program 1 times [2025-01-09 08:58:35,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:58:35,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728209304] [2025-01-09 08:58:35,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:35,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:58:35,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:58:35,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:58:35,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:35,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 08:58:35,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698384948] [2025-01-09 08:58:35,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:35,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:58:35,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:58:35,248 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 08:58:35,250 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 08:58:35,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:58:35,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:58:35,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:35,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:58:35,343 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:58:35,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-09 08:58:35,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-09 08:58:35,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:35,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:58:35,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:58:35,465 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:58:35,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:58:35,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 08:58:35,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:58:35,671 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 08:58:35,745 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:58:35,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:58:35 BoogieIcfgContainer [2025-01-09 08:58:35,748 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:58:35,749 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:58:35,749 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:58:35,749 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:58:35,749 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:58:31" (3/4) ... [2025-01-09 08:58:35,751 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:58:35,752 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:58:35,753 INFO L158 Benchmark]: Toolchain (without parser) took 5066.37ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 122.7MB in the beginning and 139.1MB in the end (delta: -16.3MB). Peak memory consumption was 202.7MB. Max. memory is 16.1GB. [2025-01-09 08:58:35,753 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:58:35,753 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.63ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 108.8MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:58:35,753 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.01ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 106.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:58:35,753 INFO L158 Benchmark]: Boogie Preprocessor took 45.85ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:58:35,754 INFO L158 Benchmark]: RCFGBuilder took 393.04ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 83.0MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 08:58:35,754 INFO L158 Benchmark]: TraceAbstraction took 4399.74ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 82.3MB in the beginning and 139.1MB in the end (delta: -56.9MB). Peak memory consumption was 160.7MB. Max. memory is 16.1GB. [2025-01-09 08:58:35,754 INFO L158 Benchmark]: Witness Printer took 3.38ms. Allocated memory is still 385.9MB. Free memory was 139.1MB in the beginning and 139.1MB in the end (delta: 78.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:58:35,755 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.63ms. Allocated memory is still 167.8MB. Free memory was 122.7MB in the beginning and 108.8MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.01ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 106.7MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.85ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.8MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 393.04ms. Allocated memory is still 167.8MB. Free memory was 103.8MB in the beginning and 83.0MB in the end (delta: 20.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4399.74ms. Allocated memory was 167.8MB in the beginning and 385.9MB in the end (delta: 218.1MB). Free memory was 82.3MB in the beginning and 139.1MB in the end (delta: -56.9MB). Peak memory consumption was 160.7MB. Max. memory is 16.1GB. * Witness Printer took 3.38ms. Allocated memory is still 385.9MB. Free memory was 139.1MB in the beginning and 139.1MB in the end (delta: 78.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 someBinaryFLOATComparisonOperation at line 135, overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryFLOATComparisonOperation at line 133, overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryFLOATComparisonOperation at line 129, overapproximation of someBinaryFLOATComparisonOperation at line 144, overapproximation of someBinaryDOUBLEComparisonOperation at line 144, overapproximation of someBinaryArithmeticFLOAToperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] signed long int var_1_2 = -1; [L24] signed long int var_1_3 = -2; [L25] unsigned char var_1_4 = 0; [L26] unsigned long int var_1_5 = 3914692693; [L27] unsigned long int var_1_6 = 32; [L28] unsigned long int var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] unsigned char var_1_9 = 0; [L31] unsigned char var_1_10 = 0; [L32] unsigned char var_1_11 = 50; [L33] signed long int var_1_12 = 25; [L34] signed long int var_1_13 = 1; [L35] float var_1_15 = 4.75; [L36] unsigned char var_1_16 = 100; [L37] float var_1_17 = 50.1; [L38] float var_1_18 = 100.9; [L39] float var_1_19 = 8.5; [L40] float var_1_20 = 10.625; [L41] float var_1_21 = 0.0; [L42] float var_1_22 = 7.8; [L43] float var_1_23 = 8.25; [L44] double var_1_24 = 5.5; VAL [isInitial=0, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=-1, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L148] isInitial = 1 [L149] FCALL initially() [L151] FCALL updateLastVariables() [L152] CALL updateVariables() [L95] var_1_2 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L96] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L97] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=-2, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L98] var_1_3 = __VERIFIER_nondet_long() [L99] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L99] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L100] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L100] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L101] var_1_4 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L102] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L103] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L103] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=3914692693, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L104] var_1_5 = __VERIFIER_nondet_ulong() [L105] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L105] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L106] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L106] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=32, var_1_7=1, var_1_8=0, var_1_9=0] [L107] var_1_6 = __VERIFIER_nondet_ulong() [L108] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_7=1, var_1_8=0, var_1_9=0] [L108] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_7=1, var_1_8=0, var_1_9=0] [L109] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L109] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=0] [L110] var_1_7 = __VERIFIER_nondet_ulong() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_8=0, var_1_9=0] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_8=0, var_1_9=0] [L112] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L113] var_1_9 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0] [L114] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0] [L115] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L115] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L118] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L118] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L119] var_1_12 = __VERIFIER_nondet_long() [L120] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L120] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L121] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L121] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L122] var_1_13 = __VERIFIER_nondet_long() [L123] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L123] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L124] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L124] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L125] var_1_16 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L126] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L127] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L127] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L128] var_1_17 = __VERIFIER_nondet_float() [L129] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L129] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L130] var_1_19 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L131] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L132] var_1_20 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L133] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L134] var_1_21 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L135] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L136] var_1_22 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L138] var_1_23 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L139] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L152] RET updateVariables() [L153] CALL step() [L48] COND FALSE !(! (var_1_2 >= var_1_3)) [L55] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L57] signed long int stepLocal_1 = var_1_3; [L58] signed long int stepLocal_0 = var_1_3; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L59] COND FALSE !(var_1_6 < stepLocal_0) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L64] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L64] unsigned long int stepLocal_3 = 5u << (var_1_12 - var_1_13); [L65] unsigned long int stepLocal_2 = var_1_7; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L66] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_4)) [L77] var_1_11 = var_1_12 VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L79] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_18=1009/10, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L84] COND FALSE !(\read(var_1_10)) [L87] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L89] signed long int stepLocal_4 = var_1_12 - var_1_11; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, stepLocal_4=0, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_24=11/2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L90] COND TRUE (~ var_1_3) <= stepLocal_4 [L91] var_1_24 = var_1_22 VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=5, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR (((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144] EXPR (! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144] EXPR (((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L144-L145] return ((((((! (var_1_2 >= var_1_3)) ? (var_1_4 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_6) - var_1_7))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_7))) && ((var_1_6 < var_1_3) ? ((var_1_3 <= var_1_6) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_4)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_11 > (var_1_6 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_3) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=127, var_1_1=0, var_1_22=2, var_1_24=2, var_1_2=0, var_1_3=0, var_1_4=1, var_1_5=-1073741826, var_1_6=0, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.3s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 262 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 262 mSDsluCounter, 1526 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 884 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 642 mSDtfsCounter, 277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 204 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 5 MinimizatonAttempts, 164 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1430 NumberOfCodeBlocks, 1430 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1064 ConstructedInterpolants, 0 QuantifiedInterpolants, 2034 SizeOfPredicates, 0 NumberOfNonLiveVariables, 389 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 9018/9072 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 08:58:35,774 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_codestructure_steplocals_file-74.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 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:58:37,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:58:37,850 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 08:58:37,854 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:58:37,854 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:58:37,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:58:37,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:58:37,913 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:58:37,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:58:37,913 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:58:37,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:58:37,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:58:37,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:58:37,914 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:58:37,914 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:58:37,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:58:37,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:58:37,915 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:58:37,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:58:37,916 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 -> 02baa2e59f749b8f6a62bf588b2331b287a06a0eaebbebe18816d2b78fb71465 [2025-01-09 08:58:38,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:58:38,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:58:38,152 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:58:38,153 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:58:38,154 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:58:38,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2025-01-09 08:58:39,344 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e1a2a2d2/801c5e6273ef48a1b603f2c4a35be79c/FLAGcf42499cd [2025-01-09 08:58:39,565 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:58:39,565 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-74.i [2025-01-09 08:58:39,571 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e1a2a2d2/801c5e6273ef48a1b603f2c4a35be79c/FLAGcf42499cd [2025-01-09 08:58:39,582 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0e1a2a2d2/801c5e6273ef48a1b603f2c4a35be79c [2025-01-09 08:58:39,584 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:58:39,585 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:58:39,586 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:58:39,586 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:58:39,589 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:58:39,589 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,590 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f0825d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39, skipping insertion in model container [2025-01-09 08:58:39,590 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:58:39,721 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_codestructure_steplocals_file-74.i[917,930] [2025-01-09 08:58:39,781 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:58:39,795 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:58:39,805 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_codestructure_steplocals_file-74.i[917,930] [2025-01-09 08:58:39,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:58:39,853 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:58:39,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39 WrapperNode [2025-01-09 08:58:39,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:58:39,854 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:58:39,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:58:39,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:58:39,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,895 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2025-01-09 08:58:39,895 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:58:39,899 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:58:39,899 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:58:39,899 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:58:39,906 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,925 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 08:58:39,925 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,937 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,937 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,948 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,950 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:58:39,954 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:58:39,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:58:39,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:58:39,958 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (1/1) ... [2025-01-09 08:58:39,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:58:39,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:58:39,989 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 08:58:39,996 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 08:58:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:58:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:58:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:58:40,015 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:58:40,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:58:40,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:58:40,074 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:58:40,076 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:58:42,050 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 08:58:42,050 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:58:42,057 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:58:42,059 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:58:42,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:58:42 BoogieIcfgContainer [2025-01-09 08:58:42,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:58:42,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:58:42,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:58:42,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:58:42,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:58:39" (1/3) ... [2025-01-09 08:58:42,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1003b4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:58:42, skipping insertion in model container [2025-01-09 08:58:42,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:58:39" (2/3) ... [2025-01-09 08:58:42,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1003b4c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:58:42, skipping insertion in model container [2025-01-09 08:58:42,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:58:42" (3/3) ... [2025-01-09 08:58:42,066 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-74.i [2025-01-09 08:58:42,075 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:58:42,077 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_steplocals_file-74.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:58:42,121 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:58:42,134 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;@1c5dfbaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:58:42,134 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:58:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:58:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 08:58:42,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:58:42,151 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:42,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:58:42,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:58:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -520090904, now seen corresponding path program 1 times [2025-01-09 08:58:42,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:58:42,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756044455] [2025-01-09 08:58:42,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:42,171 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 08:58:42,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:58:42,176 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 08:58:42,177 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 08:58:42,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 08:58:42,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 08:58:42,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:42,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:58:42,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:58:42,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:58:42,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2025-01-09 08:58:42,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:58:42,595 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:58:42,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756044455] [2025-01-09 08:58:42,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756044455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:58:42,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:58:42,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:58:42,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223520831] [2025-01-09 08:58:42,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:58:42,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:58:42,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:58:42,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:58:42,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:58:42,622 INFO L87 Difference]: Start difference. First operand has 77 states, 46 states have (on average 1.326086956521739) internal successors, (61), 47 states have internal predecessors, (61), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 08:58:42,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:58:42,640 INFO L93 Difference]: Finished difference Result 148 states and 257 transitions. [2025-01-09 08:58:42,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:58:42,642 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 175 [2025-01-09 08:58:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:58:42,646 INFO L225 Difference]: With dead ends: 148 [2025-01-09 08:58:42,646 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 08:58:42,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 174 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 08:58:42,652 INFO L435 NwaCegarLoop]: 112 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, 112 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 08:58:42,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:58:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 08:58:42,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 08:58:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:58:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2025-01-09 08:58:42,685 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 175 [2025-01-09 08:58:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:58:42,685 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2025-01-09 08:58:42,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-01-09 08:58:42,686 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2025-01-09 08:58:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 08:58:42,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:58:42,688 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:42,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 08:58:42,890 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 08:58:42,891 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:58:42,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:58:42,892 INFO L85 PathProgramCache]: Analyzing trace with hash -187048524, now seen corresponding path program 1 times [2025-01-09 08:58:42,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:58:42,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1110763982] [2025-01-09 08:58:42,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:42,893 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 08:58:42,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:58:42,896 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 08:58:42,907 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 08:58:42,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 08:58:43,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 08:58:43,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:43,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:58:43,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 08:58:43,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:58:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 777 proven. 36 refuted. 0 times theorem prover too weak. 699 trivial. 0 not checked. [2025-01-09 08:58:43,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:58:43,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 45 proven. 36 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-01-09 08:58:43,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:58:43,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1110763982] [2025-01-09 08:58:43,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1110763982] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:58:43,733 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:58:43,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-01-09 08:58:43,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283899995] [2025-01-09 08:58:43,733 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:58:43,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 08:58:43,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:58:43,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 08:58:43,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:58:43,735 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 08:58:46,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:58:46,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:58:46,127 INFO L93 Difference]: Finished difference Result 152 states and 226 transitions. [2025-01-09 08:58:46,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 08:58:46,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 175 [2025-01-09 08:58:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:58:46,147 INFO L225 Difference]: With dead ends: 152 [2025-01-09 08:58:46,148 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 08:58:46,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 342 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:58:46,149 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 48 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 08:58:46,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 165 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 08:58:46,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 08:58:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-01-09 08:58:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-01-09 08:58:46,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 111 transitions. [2025-01-09 08:58:46,159 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 111 transitions. Word has length 175 [2025-01-09 08:58:46,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:58:46,159 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 111 transitions. [2025-01-09 08:58:46,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2025-01-09 08:58:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 111 transitions. [2025-01-09 08:58:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 08:58:46,161 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:58:46,161 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 08:58:46,173 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 08:58:46,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 08:58:46,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:58:46,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:58:46,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1587958838, now seen corresponding path program 1 times [2025-01-09 08:58:46,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:58:46,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727465706] [2025-01-09 08:58:46,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:58:46,364 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 08:58:46,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:58:46,367 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 08:58:46,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 08:58:46,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 08:58:46,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 08:58:46,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:58:46,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:58:46,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-01-09 08:58:46,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:59:26,327 WARN L286 SmtUtils]: Spent 15.76s on a formula simplification that was a NOOP. DAG size: 54 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)