./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.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_normal_file-51.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 bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:42:54,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:42:54,148 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:42:54,156 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:42:54,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:42:54,179 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:42:54,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:42:54,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:42:54,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:42:54,180 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:42:54,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:42:54,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:42:54,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:42:54,180 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:42:54,181 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:42:54,181 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:42:54,181 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:42:54,182 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:42:54,182 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 08:42:54,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:42:54,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:42:54,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:42:54,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:42:54,182 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:42:54,183 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:42:54,183 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:42:54,184 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:42:54,184 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:42:54,184 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:42:54,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:42:54,184 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:42:54,184 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:42:54,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:42:54,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:42:54,184 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:42:54,185 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:42:54,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:42:54,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:42:54,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:42:54,185 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:42:54,186 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:42:54,186 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:42:54,186 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 08:42:54,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 08:42:54,186 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:42:54,186 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:42:54,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:42:54,186 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:42:54,187 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 -> bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf [2025-01-09 08:42:54,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:42:54,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:42:54,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:42:54,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:42:54,470 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:42:54,471 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2025-01-09 08:42:55,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b16beeae1/3f52cec2ee4b404d8d650adb38f51f52/FLAG888dbe395 [2025-01-09 08:42:56,053 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:42:56,070 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2025-01-09 08:42:56,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b16beeae1/3f52cec2ee4b404d8d650adb38f51f52/FLAG888dbe395 [2025-01-09 08:42:56,119 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b16beeae1/3f52cec2ee4b404d8d650adb38f51f52 [2025-01-09 08:42:56,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:42:56,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:42:56,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:42:56,124 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:42:56,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:42:56,128 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,129 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c8efec2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56, skipping insertion in model container [2025-01-09 08:42:56,129 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:42:56,286 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_normal_file-51.i[913,926] [2025-01-09 08:42:56,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:42:56,358 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:42:56,370 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_normal_file-51.i[913,926] [2025-01-09 08:42:56,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:42:56,426 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:42:56,428 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56 WrapperNode [2025-01-09 08:42:56,428 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:42:56,429 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:42:56,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:42:56,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:42:56,438 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:42:56" (1/1) ... [2025-01-09 08:42:56,449 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:42:56" (1/1) ... [2025-01-09 08:42:56,482 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 164 [2025-01-09 08:42:56,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:42:56,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:42:56,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:42:56,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:42:56,496 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,524 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:42:56,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,525 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,530 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,531 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,533 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,534 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,535 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,537 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:42:56,538 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:42:56,538 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:42:56,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:42:56,539 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (1/1) ... [2025-01-09 08:42:56,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:42:56,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:42:56,573 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:42:56,577 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:42:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:42:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:42:56,592 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:42:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 08:42:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:42:56,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:42:56,655 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:42:56,656 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:42:56,919 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:42:56,920 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:42:56,930 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:42:56,930 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:42:56,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:42:56 BoogieIcfgContainer [2025-01-09 08:42:56,931 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:42:56,932 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:42:56,932 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:42:56,937 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:42:56,937 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:42:56" (1/3) ... [2025-01-09 08:42:56,938 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f39680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:42:56, skipping insertion in model container [2025-01-09 08:42:56,938 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:42:56" (2/3) ... [2025-01-09 08:42:56,939 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22f39680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:42:56, skipping insertion in model container [2025-01-09 08:42:56,939 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:42:56" (3/3) ... [2025-01-09 08:42:56,940 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-51.i [2025-01-09 08:42:56,950 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:42:56,952 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-51.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:42:57,010 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:42:57,023 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;@6fce61e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:42:57,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:42:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 08:42:57,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 08:42:57,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:42:57,043 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,044 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:42:57,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:42:57,050 INFO L85 PathProgramCache]: Analyzing trace with hash 634455260, now seen corresponding path program 1 times [2025-01-09 08:42:57,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:42:57,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504770753] [2025-01-09 08:42:57,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:42:57,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:42:57,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 08:42:57,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 08:42:57,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:42:57,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:42:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-01-09 08:42:57,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:42:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504770753] [2025-01-09 08:42:57,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504770753] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:42:57,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [127723497] [2025-01-09 08:42:57,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:42:57,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:42:57,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:42:57,392 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:42:57,393 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:42:57,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 08:42:57,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 08:42:57,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:42:57,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:42:57,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:42:57,606 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:42:57,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 1682 trivial. 0 not checked. [2025-01-09 08:42:57,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:42:57,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [127723497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:42:57,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:42:57,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 08:42:57,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992935605] [2025-01-09 08:42:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:42:57,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:42:57,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:42:57,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:42:57,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:42:57,672 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 08:42:57,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:42:57,697 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2025-01-09 08:42:57,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:42:57,699 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 182 [2025-01-09 08:42:57,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:42:57,704 INFO L225 Difference]: With dead ends: 148 [2025-01-09 08:42:57,704 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 08:42:57,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 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:42:57,710 INFO L435 NwaCegarLoop]: 115 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, 115 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:42:57,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:42:57,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 08:42:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 08:42:57,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 08:42:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 115 transitions. [2025-01-09 08:42:57,750 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 115 transitions. Word has length 182 [2025-01-09 08:42:57,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:42:57,751 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 115 transitions. [2025-01-09 08:42:57,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 08:42:57,752 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 115 transitions. [2025-01-09 08:42:57,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 08:42:57,756 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:42:57,756 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 08:42:57,957 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:42:57,957 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:42:57,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:42:57,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1851719004, now seen corresponding path program 1 times [2025-01-09 08:42:57,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:42:57,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495305009] [2025-01-09 08:42:57,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:42:57,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:42:57,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 08:42:58,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 08:42:58,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:42:58,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:42:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-01-09 08:42:58,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:42:58,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495305009] [2025-01-09 08:42:58,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495305009] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:42:58,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:42:58,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 08:42:58,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924848045] [2025-01-09 08:42:58,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:42:58,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:42:58,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:42:58,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:42:58,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 08:42:58,219 INFO L87 Difference]: Start difference. First operand 74 states and 115 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-01-09 08:42:58,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:42:58,268 INFO L93 Difference]: Finished difference Result 190 states and 294 transitions. [2025-01-09 08:42:58,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:42:58,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 182 [2025-01-09 08:42:58,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:42:58,274 INFO L225 Difference]: With dead ends: 190 [2025-01-09 08:42:58,274 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 08:42:58,275 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:42:58,275 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 66 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:42:58,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 218 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:42:58,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 08:42:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2025-01-09 08:42:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 08:42:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 179 transitions. [2025-01-09 08:42:58,305 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 179 transitions. Word has length 182 [2025-01-09 08:42:58,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:42:58,305 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 179 transitions. [2025-01-09 08:42:58,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-01-09 08:42:58,306 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 179 transitions. [2025-01-09 08:42:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 08:42:58,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:42:58,310 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:58,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 08:42:58,311 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:42:58,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:42:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash -739189037, now seen corresponding path program 1 times [2025-01-09 08:42:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:42:58,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275631784] [2025-01-09 08:42:58,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:42:58,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:42:58,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 08:42:58,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 08:42:58,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:42:58,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:42:58,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-01-09 08:42:58,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 08:42:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275631784] [2025-01-09 08:42:58,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275631784] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:42:58,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049969387] [2025-01-09 08:42:58,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:42:58,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:42:58,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:42:58,793 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:42:58,795 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:42:58,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 08:42:58,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 08:42:58,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:42:58,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:42:58,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 08:42:58,955 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:42:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-01-09 08:42:59,155 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:42:59,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 39 proven. 48 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2025-01-09 08:42:59,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049969387] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 08:42:59,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 08:42:59,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 08:42:59,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340171283] [2025-01-09 08:42:59,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 08:42:59,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 08:42:59,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 08:42:59,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 08:42:59,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 08:42:59,420 INFO L87 Difference]: Start difference. First operand 116 states and 179 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2025-01-09 08:42:59,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:42:59,664 INFO L93 Difference]: Finished difference Result 241 states and 365 transitions. [2025-01-09 08:42:59,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:42:59,665 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) Word has length 183 [2025-01-09 08:42:59,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:42:59,671 INFO L225 Difference]: With dead ends: 241 [2025-01-09 08:42:59,671 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 08:42:59,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 363 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 08:42:59,673 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 88 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 08:42:59,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 167 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 08:42:59,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 08:42:59,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-01-09 08:42:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 73 states have internal predecessors, (89), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 08:42:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2025-01-09 08:42:59,691 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 183 [2025-01-09 08:42:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:42:59,691 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2025-01-09 08:42:59,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 3 states have call predecessors, (63), 3 states have call successors, (63) [2025-01-09 08:42:59,692 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2025-01-09 08:42:59,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 08:42:59,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:42:59,694 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:59,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 08:42:59,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 08:42:59,899 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:42:59,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:42:59,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1548535663, now seen corresponding path program 1 times [2025-01-09 08:42:59,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 08:42:59,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107721119] [2025-01-09 08:42:59,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:42:59,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 08:42:59,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 08:43:00,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 08:43:00,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:43:00,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:43:00,008 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 08:43:00,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 08:43:00,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 08:43:00,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:43:00,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 08:43:00,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 08:43:00,185 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 08:43:00,186 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 08:43:00,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 08:43:00,190 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 08:43:00,310 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 08:43:00,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 08:43:00 BoogieIcfgContainer [2025-01-09 08:43:00,314 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 08:43:00,315 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 08:43:00,315 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 08:43:00,315 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 08:43:00,315 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:42:56" (3/4) ... [2025-01-09 08:43:00,317 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 08:43:00,318 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 08:43:00,319 INFO L158 Benchmark]: Toolchain (without parser) took 4195.85ms. Allocated memory is still 142.6MB. Free memory was 112.7MB in the beginning and 73.3MB in the end (delta: 39.3MB). Peak memory consumption was 36.8MB. Max. memory is 16.1GB. [2025-01-09 08:43:00,319 INFO L158 Benchmark]: CDTParser took 0.92ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:43:00,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.86ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.5MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:43:00,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.43ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 08:43:00,320 INFO L158 Benchmark]: Boogie Preprocessor took 51.26ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:43:00,320 INFO L158 Benchmark]: RCFGBuilder took 392.38ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 73.4MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 08:43:00,321 INFO L158 Benchmark]: TraceAbstraction took 3381.83ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 73.4MB in the end (delta: -456.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:43:00,321 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 73.3MB in the end (delta: 27.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 08:43:00,323 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.92ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.86ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.5MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.43ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 95.8MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.26ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 93.1MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 392.38ms. Allocated memory is still 142.6MB. Free memory was 93.1MB in the beginning and 73.4MB in the end (delta: 19.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3381.83ms. Allocated memory is still 142.6MB. Free memory was 72.9MB in the beginning and 73.4MB in the end (delta: -456.5kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 142.6MB. Free memory was 73.4MB in the beginning and 73.3MB in the end (delta: 27.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 someUnaryDOUBLEoperation at line 42, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 57, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 133, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 73, overapproximation of someBinaryDOUBLEComparisonOperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 128; [L23] unsigned long int var_1_2 = 32; [L24] unsigned long int var_1_3 = 128; [L25] double var_1_4 = 32.3; [L26] double var_1_5 = 0.25; [L27] double var_1_6 = 500.6; [L28] unsigned char var_1_7 = 2; [L29] signed char var_1_8 = -10; [L30] signed char var_1_9 = 5; [L31] signed char var_1_10 = 4; [L32] signed char var_1_11 = 100; [L33] unsigned long int var_1_12 = 8; [L34] unsigned char var_1_13 = 0; [L35] unsigned char var_1_14 = 1; [L36] unsigned long int var_1_15 = 1114432789; [L37] unsigned long int var_1_16 = 2; [L38] double var_1_17 = 256.8; [L39] double var_1_18 = 1.25; [L40] unsigned long int var_1_19 = 16; [L41] unsigned char var_1_21 = 1; [L42] double var_1_22 = -0.5; [L43] unsigned char var_1_23 = 0; [L44] unsigned char var_1_24 = 1; VAL [isInitial=0, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=32, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L151] isInitial = 1 [L152] FCALL initially() [L154] FCALL updateLastVariables() [L155] CALL updateVariables() [L96] var_1_2 = __VERIFIER_nondet_ulong() [L97] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L97] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L98] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L98] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_3=128, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L99] var_1_3 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L100] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L101] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_4=323/10, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L102] var_1_4 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L103] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_5=1/4, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L104] var_1_5 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L105] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_6=2503/5, var_1_7=2, var_1_8=-10, var_1_9=5] [L106] var_1_6 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L107] RET assume_abort_if_not((var_1_6 >= -922337.2036854776000e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=2, var_1_8=-10, var_1_9=5] [L108] var_1_7 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L109] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_8=-10, var_1_9=5] [L110] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L110] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=5] [L111] var_1_9 = __VERIFIER_nondet_char() [L112] CALL assume_abort_if_not(var_1_9 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L112] RET assume_abort_if_not(var_1_9 >= -1) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L113] CALL assume_abort_if_not(var_1_9 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L113] RET assume_abort_if_not(var_1_9 <= 126) VAL [isInitial=1, var_1_10=4, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L114] var_1_10 = __VERIFIER_nondet_char() [L115] CALL assume_abort_if_not(var_1_10 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L115] RET assume_abort_if_not(var_1_10 >= -1) VAL [isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_10 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L116] RET assume_abort_if_not(var_1_10 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=100, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L117] var_1_11 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L118] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L119] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=0, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L120] var_1_13 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L121] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L122] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L123] var_1_14 = __VERIFIER_nondet_uchar() [L124] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L124] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L125] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L125] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=1114432789, var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L126] var_1_15 = __VERIFIER_nondet_ulong() [L127] CALL assume_abort_if_not(var_1_15 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L127] RET assume_abort_if_not(var_1_15 >= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L128] CALL assume_abort_if_not(var_1_15 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L128] RET assume_abort_if_not(var_1_15 <= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=2, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L129] var_1_16 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L130] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L131] CALL assume_abort_if_not(var_1_16 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L131] RET assume_abort_if_not(var_1_16 <= 1073741823) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_18=5/4, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L132] var_1_18 = __VERIFIER_nondet_double() [L133] CALL assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L133] RET assume_abort_if_not((var_1_18 >= -922337.2036854765600e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 9223372.036854765600e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L134] var_1_22 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L135] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L136] CALL assume_abort_if_not(var_1_22 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L136] RET assume_abort_if_not(var_1_22 != 0.0F) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L137] var_1_23 = __VERIFIER_nondet_uchar() [L138] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L138] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L139] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L139] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L140] var_1_24 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L141] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L142] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L142] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=128, var_1_21=1, var_1_23=0, var_1_24=1, var_1_7=-2, var_1_8=-10, var_1_9=1] [L155] RET updateVariables() [L156] CALL step() [L48] COND FALSE !(32u >= var_1_2) [L55] var_1_1 = var_1_7 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-10, var_1_9=1] [L57] COND FALSE !(! (var_1_6 > var_1_5)) [L60] var_1_8 = -4 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=8, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-4, var_1_9=1] [L62] COND TRUE var_1_13 && var_1_14 [L63] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-4, var_1_9=1] [L69] COND FALSE !((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-4, var_1_9=1] [L72] COND TRUE var_1_14 || (((((var_1_4) > (var_1_6)) ? (var_1_4) : (var_1_6))) > var_1_18) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=16, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-4, var_1_9=1] [L73] COND TRUE var_1_18 > ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) [L74] var_1_19 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=4294967296, var_1_1=-2, var_1_21=1, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-4, var_1_9=1] [L81] COND FALSE !((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) [L92] var_1_21 = var_1_23 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=4294967296, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_2=33, var_1_7=-2, var_1_8=-4, var_1_9=1] [L156] RET step() [L157] CALL, EXPR property() [L147-L148] return ((((((32u >= var_1_2) ? ((var_1_2 <= var_1_3) ? (((var_1_4 - var_1_5) >= var_1_6) ? (var_1_1 == ((unsigned char) var_1_7)) : 1) : 1) : (var_1_1 == ((unsigned char) var_1_7))) && ((! (var_1_6 > var_1_5)) ? (var_1_8 == ((signed char) (((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))) - var_1_11))) : (var_1_8 == ((signed char) -4)))) && ((var_1_13 && var_1_14) ? (var_1_12 == ((unsigned long int) var_1_11)) : (var_1_13 ? (var_1_12 == ((unsigned long int) (((((var_1_1) > ((var_1_11 + var_1_7))) ? (var_1_1) : ((var_1_11 + var_1_7)))) + (var_1_15 - var_1_16)))) : 1))) && (((((((~ var_1_1)) < (8)) ? ((~ var_1_1)) : (8))) > var_1_11) ? (var_1_17 == ((double) var_1_18)) : 1)) && ((var_1_14 || (((((var_1_4) > (var_1_6)) ? (var_1_4) : (var_1_6))) > var_1_18)) ? ((var_1_18 > ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17)))) ? (var_1_19 == ((unsigned long int) var_1_16)) : (var_1_19 == ((unsigned long int) var_1_11))) : (var_1_19 == ((unsigned long int) var_1_16)))) && (((var_1_18 / ((((5.5) > (var_1_22)) ? (5.5) : (var_1_22)))) > 10.5) ? (var_1_13 ? ((var_1_2 < var_1_3) ? (var_1_21 == ((unsigned char) (! var_1_23))) : (var_1_21 == ((unsigned char) var_1_24))) : (var_1_21 == ((unsigned char) var_1_23))) : (var_1_21 == ((unsigned char) var_1_23))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=4294967296, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_2=33, var_1_3=0, var_1_7=-2, var_1_8=-4, var_1_9=1] [L157] RET, EXPR property() [L157] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=4294967296, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_2=33, var_1_3=0, var_1_7=-2, var_1_8=-4, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=1, var_1_14=1, var_1_15=-(((__int128) 0 << 64) | 18446744068340842497U), var_1_16=4294967296, var_1_17=1284/5, var_1_19=4294967296, var_1_1=-2, var_1_21=0, var_1_23=0, var_1_24=1, var_1_2=33, var_1_3=0, var_1_7=-2, var_1_8=-4, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 4, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 154 mSDsluCounter, 500 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 196 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 304 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 558 GetRequests, 548 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1095 NumberOfCodeBlocks, 1095 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1089 ConstructedInterpolants, 0 QuantifiedInterpolants, 1505 SizeOfPredicates, 3 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 10238/10440 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:43:00,343 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_normal_file-51.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 bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 08:43:02,527 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 08:43:02,618 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:43:02,626 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 08:43:02,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 08:43:02,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 08:43:02,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 08:43:02,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 08:43:02,661 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 08:43:02,661 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 08:43:02,661 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 08:43:02,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 08:43:02,662 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 08:43:02,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 08:43:02,663 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 08:43:02,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 08:43:02,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 08:43:02,664 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:43:02,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:43:02,665 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:43:02,665 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 08:43:02,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 08:43:02,668 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 08:43:02,668 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 08:43:02,668 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 -> bb9ebd7191292941d0aec0d028201faa00d28c37083b8685d3172a0ea02d5ecf [2025-01-09 08:43:02,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 08:43:02,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 08:43:02,954 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 08:43:02,955 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 08:43:02,955 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 08:43:02,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2025-01-09 08:43:04,269 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37bcc94fd/b47d4dd4144f41b6b1c52f539424eb90/FLAG26220c3a8 [2025-01-09 08:43:04,490 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 08:43:04,491 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-51.i [2025-01-09 08:43:04,503 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37bcc94fd/b47d4dd4144f41b6b1c52f539424eb90/FLAG26220c3a8 [2025-01-09 08:43:04,523 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37bcc94fd/b47d4dd4144f41b6b1c52f539424eb90 [2025-01-09 08:43:04,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 08:43:04,527 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 08:43:04,529 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 08:43:04,529 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 08:43:04,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 08:43:04,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c899268 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04, skipping insertion in model container [2025-01-09 08:43:04,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,551 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 08:43:04,681 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_normal_file-51.i[913,926] [2025-01-09 08:43:04,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:43:04,769 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 08:43:04,778 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_normal_file-51.i[913,926] [2025-01-09 08:43:04,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 08:43:04,824 INFO L204 MainTranslator]: Completed translation [2025-01-09 08:43:04,826 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04 WrapperNode [2025-01-09 08:43:04,826 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 08:43:04,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 08:43:04,829 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 08:43:04,829 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 08:43:04,834 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:43:04" (1/1) ... [2025-01-09 08:43:04,848 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:43:04" (1/1) ... [2025-01-09 08:43:04,882 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 161 [2025-01-09 08:43:04,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 08:43:04,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 08:43:04,886 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 08:43:04,886 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 08:43:04,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,908 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,932 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:43:04,932 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,933 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,943 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,944 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,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:43:04" (1/1) ... [2025-01-09 08:43:04,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:43:04" (1/1) ... [2025-01-09 08:43:04,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,952 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 08:43:04,953 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 08:43:04,954 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 08:43:04,954 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 08:43:04,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04" (1/1) ... [2025-01-09 08:43:04,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 08:43:04,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 08:43:04,995 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:43:04,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 08:43:05,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 08:43:05,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 08:43:05,020 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 08:43:05,020 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 08:43:05,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 08:43:05,021 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 08:43:05,101 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 08:43:05,104 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 08:43:18,636 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 08:43:18,637 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 08:43:18,645 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 08:43:18,646 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 08:43:18,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:43:18 BoogieIcfgContainer [2025-01-09 08:43:18,646 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 08:43:18,666 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 08:43:18,666 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 08:43:18,670 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 08:43:18,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 08:43:04" (1/3) ... [2025-01-09 08:43:18,671 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdc1d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:43:18, skipping insertion in model container [2025-01-09 08:43:18,671 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 08:43:04" (2/3) ... [2025-01-09 08:43:18,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cdc1d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 08:43:18, skipping insertion in model container [2025-01-09 08:43:18,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 08:43:18" (3/3) ... [2025-01-09 08:43:18,673 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-51.i [2025-01-09 08:43:18,684 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 08:43:18,686 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_codestructure_normal_file-51.i that has 2 procedures, 77 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 08:43:18,736 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 08:43:18,745 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;@3846ccf5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 08:43:18,745 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 08:43:18,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 08:43:18,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 08:43:18,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:43:18,760 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:18,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:43:18,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:43:18,765 INFO L85 PathProgramCache]: Analyzing trace with hash 634455260, now seen corresponding path program 1 times [2025-01-09 08:43:18,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:43:18,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1781655153] [2025-01-09 08:43:18,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:43:18,777 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:43:18,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:43:18,782 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:43:18,783 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:43:18,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 08:43:19,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 08:43:19,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:43:19,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:43:19,577 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 08:43:19,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:43:19,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 538 proven. 0 refuted. 0 times theorem prover too weak. 1202 trivial. 0 not checked. [2025-01-09 08:43:19,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:43:19,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:43:19,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1781655153] [2025-01-09 08:43:19,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1781655153] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:43:19,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 08:43:19,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 08:43:19,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142170845] [2025-01-09 08:43:19,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:43:19,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 08:43:19,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:43:19,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 08:43:19,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 08:43:19,653 INFO L87 Difference]: Start difference. First operand has 77 states, 44 states have (on average 1.3636363636363635) internal successors, (60), 45 states have internal predecessors, (60), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 08:43:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:43:19,687 INFO L93 Difference]: Finished difference Result 148 states and 265 transitions. [2025-01-09 08:43:19,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 08:43:19,689 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 182 [2025-01-09 08:43:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:43:19,695 INFO L225 Difference]: With dead ends: 148 [2025-01-09 08:43:19,695 INFO L226 Difference]: Without dead ends: 74 [2025-01-09 08:43:19,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 181 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:43:19,700 INFO L435 NwaCegarLoop]: 115 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, 115 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:43:19,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 08:43:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-01-09 08:43:19,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-01-09 08:43:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 42 states have internal predecessors, (55), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-01-09 08:43:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 115 transitions. [2025-01-09 08:43:19,753 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 115 transitions. Word has length 182 [2025-01-09 08:43:19,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:43:19,754 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 115 transitions. [2025-01-09 08:43:19,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 08:43:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 115 transitions. [2025-01-09 08:43:19,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 08:43:19,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:43:19,759 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:19,784 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:43:19,960 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:43:19,961 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:43:19,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:43:19,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1851719004, now seen corresponding path program 1 times [2025-01-09 08:43:19,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:43:19,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885285861] [2025-01-09 08:43:19,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:43:19,964 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:43:19,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:43:19,967 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:43:19,969 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:43:20,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 08:43:20,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 08:43:20,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:43:20,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:43:20,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 08:43:20,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:43:22,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-01-09 08:43:22,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:43:23,320 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:43:23,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885285861] [2025-01-09 08:43:23,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885285861] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:43:23,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [30407924] [2025-01-09 08:43:23,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:43:23,321 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 08:43:23,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 08:43:23,344 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 08:43:23,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2025-01-09 08:43:23,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 08:43:23,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 08:43:23,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:43:23,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:43:23,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 08:43:23,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:43:23,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2025-01-09 08:43:23,920 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 08:43:23,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [30407924] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 08:43:23,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 08:43:23,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 08:43:23,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053811451] [2025-01-09 08:43:23,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 08:43:23,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 08:43:23,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:43:23,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 08:43:23,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:43:23,923 INFO L87 Difference]: Start difference. First operand 74 states and 115 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-01-09 08:43:28,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:43:30,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:43:30,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:43:31,000 INFO L93 Difference]: Finished difference Result 190 states and 294 transitions. [2025-01-09 08:43:31,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 08:43:31,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 182 [2025-01-09 08:43:31,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:43:31,081 INFO L225 Difference]: With dead ends: 190 [2025-01-09 08:43:31,081 INFO L226 Difference]: Without dead ends: 119 [2025-01-09 08:43:31,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 369 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 08:43:31,083 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 66 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2025-01-09 08:43:31,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 218 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 7.0s Time] [2025-01-09 08:43:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-01-09 08:43:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2025-01-09 08:43:31,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 67 states have internal predecessors, (85), 47 states have call successors, (47), 2 states have call predecessors, (47), 2 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 08:43:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 179 transitions. [2025-01-09 08:43:31,106 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 179 transitions. Word has length 182 [2025-01-09 08:43:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:43:31,107 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 179 transitions. [2025-01-09 08:43:31,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2025-01-09 08:43:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 179 transitions. [2025-01-09 08:43:31,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 08:43:31,110 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:43:31,110 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:31,129 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:43:31,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2025-01-09 08:43:31,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-01-09 08:43:31,511 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:43:31,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:43:31,512 INFO L85 PathProgramCache]: Analyzing trace with hash -739189037, now seen corresponding path program 1 times [2025-01-09 08:43:31,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:43:31,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433396581] [2025-01-09 08:43:31,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:43:31,513 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:43:31,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:43:31,515 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 08:43:31,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-01-09 08:43:31,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 08:43:32,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 08:43:32,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:43:32,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:43:32,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 08:43:32,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:43:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-01-09 08:43:34,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:43:34,664 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 08:43:34,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433396581] [2025-01-09 08:43:34,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433396581] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:43:34,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [612230454] [2025-01-09 08:43:34,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:43:34,665 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 08:43:34,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 08:43:34,667 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 08:43:34,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2025-01-09 08:43:34,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 08:43:36,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 08:43:36,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:43:36,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:43:36,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 08:43:36,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:43:38,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 887 proven. 48 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-01-09 08:43:38,056 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 08:43:38,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [612230454] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 08:43:38,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 08:43:38,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2025-01-09 08:43:38,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725968972] [2025-01-09 08:43:38,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 08:43:38,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 08:43:38,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 08:43:38,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 08:43:38,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 08:43:38,253 INFO L87 Difference]: Start difference. First operand 116 states and 179 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 08:43:44,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:43:48,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:43:52,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 08:43:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 08:43:52,381 INFO L93 Difference]: Finished difference Result 241 states and 365 transitions. [2025-01-09 08:43:52,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 08:43:52,472 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), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 183 [2025-01-09 08:43:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 08:43:52,475 INFO L225 Difference]: With dead ends: 241 [2025-01-09 08:43:52,476 INFO L226 Difference]: Without dead ends: 128 [2025-01-09 08:43:52,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-01-09 08:43:52,477 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 51 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2025-01-09 08:43:52,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 169 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 163 Invalid, 3 Unknown, 0 Unchecked, 13.9s Time] [2025-01-09 08:43:52,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-01-09 08:43:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 124. [2025-01-09 08:43:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 72 states have (on average 1.2361111111111112) internal successors, (89), 73 states have internal predecessors, (89), 47 states have call successors, (47), 4 states have call predecessors, (47), 4 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2025-01-09 08:43:52,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 183 transitions. [2025-01-09 08:43:52,501 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 183 transitions. Word has length 183 [2025-01-09 08:43:52,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 08:43:52,503 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 183 transitions. [2025-01-09 08:43:52,503 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), 2 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 08:43:52,504 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 183 transitions. [2025-01-09 08:43:52,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 08:43:52,506 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 08:43:52,506 INFO L218 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43:52,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2025-01-09 08:43:52,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-01-09 08:43:52,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 08:43:52,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 08:43:52,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 08:43:52,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1548535663, now seen corresponding path program 1 times [2025-01-09 08:43:52,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 08:43:52,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616712668] [2025-01-09 08:43:52,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 08:43:52,908 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:43:52,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 08:43:52,912 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 08:43:52,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-01-09 08:43:52,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 08:43:53,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 08:43:53,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 08:43:53,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 08:43:53,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 08:43:53,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 08:44:06,638 WARN L286 SmtUtils]: Spent 8.41s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 08:44:14,986 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 08:44:23,356 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 08:44:31,704 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)