./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.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 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:25:39,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:25:39,138 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:25:39,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:25:39,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:25:39,173 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:25:39,174 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:25:39,174 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:25:39,175 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:25:39,175 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:25:39,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:25:39,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:25:39,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:25:39,176 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:25:39,177 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:25:39,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:25:39,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:25:39,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:25:39,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:25:39,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:25:39,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:25:39,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:25:39,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:25:39,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:25:39,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:25:39,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:25:39,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:25:39,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:25:39,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:25:39,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:25:39,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:25:39,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:25:39,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:25:39,179 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:25:39,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:25:39,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:25:39,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:25:39,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:25:39,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:25:39,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:25:39,180 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:25:39,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:25:39,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:25:39,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:25:39,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:25:39,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:25:39,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:25:39,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:25:39,181 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 -> 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c [2025-01-09 12:25:39,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:25:39,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:25:39,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:25:39,460 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:25:39,460 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:25:39,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i [2025-01-09 12:25:40,753 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48d5a98be/3b37f0352e904e76b7ae2c985415fc59/FLAG9d01cd9d0 [2025-01-09 12:25:41,038 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:25:41,038 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i [2025-01-09 12:25:41,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48d5a98be/3b37f0352e904e76b7ae2c985415fc59/FLAG9d01cd9d0 [2025-01-09 12:25:41,058 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/48d5a98be/3b37f0352e904e76b7ae2c985415fc59 [2025-01-09 12:25:41,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:25:41,061 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:25:41,062 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:25:41,062 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:25:41,066 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:25:41,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,067 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ecc5b62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41, skipping insertion in model container [2025-01-09 12:25:41,068 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,089 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:25:41,218 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i[913,926] [2025-01-09 12:25:41,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:25:41,309 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:25:41,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i[913,926] [2025-01-09 12:25:41,357 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:25:41,376 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:25:41,379 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41 WrapperNode [2025-01-09 12:25:41,379 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:25:41,380 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:25:41,380 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:25:41,380 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:25:41,386 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,437 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 163 [2025-01-09 12:25:41,437 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:25:41,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:25:41,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:25:41,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:25:41,444 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,468 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:25:41,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,476 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,478 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,481 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,482 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,483 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,486 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:25:41,487 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:25:41,487 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:25:41,487 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:25:41,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (1/1) ... [2025-01-09 12:25:41,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:25:41,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:25:41,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:25:41,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:25:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:25:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:25:41,557 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:25:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:25:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:25:41,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:25:41,630 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:25:41,632 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:25:41,970 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 12:25:41,971 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:25:41,983 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:25:41,984 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:25:41,984 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:25:41 BoogieIcfgContainer [2025-01-09 12:25:41,984 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:25:41,986 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:25:41,986 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:25:41,990 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:25:41,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:25:41" (1/3) ... [2025-01-09 12:25:41,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1308d2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:25:41, skipping insertion in model container [2025-01-09 12:25:41,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:25:41" (2/3) ... [2025-01-09 12:25:41,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1308d2df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:25:41, skipping insertion in model container [2025-01-09 12:25:41,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:25:41" (3/3) ... [2025-01-09 12:25:41,992 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-98.i [2025-01-09 12:25:42,005 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:25:42,007 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-98.i that has 2 procedures, 73 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:25:42,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:25:42,072 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;@1a7cb94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:25:42,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:25:42,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:25:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 12:25:42,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:25:42,090 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:25:42,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:25:42,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:25:42,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1487077433, now seen corresponding path program 1 times [2025-01-09 12:25:42,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:25:42,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284549886] [2025-01-09 12:25:42,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:25:42,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:25:42,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:25:42,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:25:42,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:25:42,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:25:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 12:25:42,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:25:42,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284549886] [2025-01-09 12:25:42,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284549886] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:25:42,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465996846] [2025-01-09 12:25:42,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:25:42,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:25:42,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:25:42,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:25:42,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 12:25:42,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:25:42,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:25:42,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:25:42,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:25:42,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:25:42,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:25:42,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 12:25:42,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:25:42,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465996846] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:25:42,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:25:42,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:25:42,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764231806] [2025-01-09 12:25:42,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:25:42,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:25:42,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:25:42,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:25:42,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:25:42,709 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 47 states have internal predecessors, (63), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:25:42,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:25:42,745 INFO L93 Difference]: Finished difference Result 140 states and 241 transitions. [2025-01-09 12:25:42,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:25:42,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2025-01-09 12:25:42,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:25:42,753 INFO L225 Difference]: With dead ends: 140 [2025-01-09 12:25:42,753 INFO L226 Difference]: Without dead ends: 70 [2025-01-09 12:25:42,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:25:42,761 INFO L435 NwaCegarLoop]: 106 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, 106 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:25:42,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:25:42,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-01-09 12:25:42,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-01-09 12:25:42,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 44 states have internal predecessors, (58), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:25:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 106 transitions. [2025-01-09 12:25:42,812 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 106 transitions. Word has length 153 [2025-01-09 12:25:42,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:25:42,813 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 106 transitions. [2025-01-09 12:25:42,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:25:42,813 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 106 transitions. [2025-01-09 12:25:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 12:25:42,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:25:42,818 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:25:42,825 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 12:25:43,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 12:25:43,019 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:25:43,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:25:43,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1228845247, now seen corresponding path program 1 times [2025-01-09 12:25:43,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:25:43,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251367751] [2025-01-09 12:25:43,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:25:43,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:25:43,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:25:43,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:25:43,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:25:43,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:25:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:25:44,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:25:44,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251367751] [2025-01-09 12:25:44,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251367751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:25:44,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:25:44,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:25:44,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229394999] [2025-01-09 12:25:44,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:25:44,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:25:44,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:25:44,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:25:44,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:25:44,189 INFO L87 Difference]: Start difference. First operand 70 states and 106 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:25:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:25:44,278 INFO L93 Difference]: Finished difference Result 144 states and 220 transitions. [2025-01-09 12:25:44,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:25:44,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2025-01-09 12:25:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:25:44,282 INFO L225 Difference]: With dead ends: 144 [2025-01-09 12:25:44,283 INFO L226 Difference]: Without dead ends: 77 [2025-01-09 12:25:44,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:25:44,284 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 19 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:25:44,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 182 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:25:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-01-09 12:25:44,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2025-01-09 12:25:44,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 44 states have internal predecessors, (57), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:25:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 105 transitions. [2025-01-09 12:25:44,298 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 105 transitions. Word has length 153 [2025-01-09 12:25:44,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:25:44,300 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 105 transitions. [2025-01-09 12:25:44,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:25:44,300 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 105 transitions. [2025-01-09 12:25:44,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 12:25:44,301 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:25:44,304 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:25:44,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:25:44,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:25:44,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:25:44,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1487010685, now seen corresponding path program 1 times [2025-01-09 12:25:44,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:25:44,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938188138] [2025-01-09 12:25:44,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:25:44,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:25:44,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:25:44,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:25:44,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:25:44,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:25:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:25:45,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:25:45,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938188138] [2025-01-09 12:25:45,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938188138] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:25:45,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:25:45,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:25:45,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811911455] [2025-01-09 12:25:45,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:25:45,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:25:45,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:25:45,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:25:45,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:25:45,487 INFO L87 Difference]: Start difference. First operand 70 states and 105 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:25:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:25:46,153 INFO L93 Difference]: Finished difference Result 296 states and 447 transitions. [2025-01-09 12:25:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:25:46,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2025-01-09 12:25:46,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:25:46,159 INFO L225 Difference]: With dead ends: 296 [2025-01-09 12:25:46,159 INFO L226 Difference]: Without dead ends: 229 [2025-01-09 12:25:46,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:25:46,160 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 351 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:25:46,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 283 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:25:46,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-01-09 12:25:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 178. [2025-01-09 12:25:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 106 states have (on average 1.2641509433962264) internal successors, (134), 107 states have internal predecessors, (134), 68 states have call successors, (68), 3 states have call predecessors, (68), 3 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 12:25:46,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 270 transitions. [2025-01-09 12:25:46,222 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 270 transitions. Word has length 153 [2025-01-09 12:25:46,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:25:46,223 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 270 transitions. [2025-01-09 12:25:46,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:25:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 270 transitions. [2025-01-09 12:25:46,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 12:25:46,225 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:25:46,225 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:25:46,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:25:46,226 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:25:46,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:25:46,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1032949249, now seen corresponding path program 1 times [2025-01-09 12:25:46,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:25:46,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873905431] [2025-01-09 12:25:46,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:25:46,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:25:46,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:25:46,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:25:46,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:25:46,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:26:42,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:26:42,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:26:42,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873905431] [2025-01-09 12:26:42,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873905431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:26:42,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:26:42,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 12:26:42,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400334226] [2025-01-09 12:26:42,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:26:42,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 12:26:42,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:26:42,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 12:26:42,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-01-09 12:26:42,166 INFO L87 Difference]: Start difference. First operand 178 states and 270 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:26:43,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:26:43,775 INFO L93 Difference]: Finished difference Result 380 states and 574 transitions. [2025-01-09 12:26:43,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 12:26:43,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 153 [2025-01-09 12:26:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:26:43,780 INFO L225 Difference]: With dead ends: 380 [2025-01-09 12:26:43,780 INFO L226 Difference]: Without dead ends: 205 [2025-01-09 12:26:43,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:26:43,782 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 54 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:26:43,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 381 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:26:43,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-01-09 12:26:43,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 200. [2025-01-09 12:26:43,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 128 states have (on average 1.2734375) internal successors, (163), 129 states have internal predecessors, (163), 68 states have call successors, (68), 3 states have call predecessors, (68), 3 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 12:26:43,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 299 transitions. [2025-01-09 12:26:43,827 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 299 transitions. Word has length 153 [2025-01-09 12:26:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:26:43,828 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 299 transitions. [2025-01-09 12:26:43,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:26:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 299 transitions. [2025-01-09 12:26:43,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 12:26:43,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:26:43,830 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:26:43,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:26:43,830 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:26:43,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:26:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash 267023735, now seen corresponding path program 1 times [2025-01-09 12:26:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:26:43,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43333187] [2025-01-09 12:26:43,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:26:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:26:43,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:26:43,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:26:43,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:26:43,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:26:43,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [203350958] [2025-01-09 12:26:43,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:26:43,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:26:43,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:26:43,951 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 12:26:43,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 12:26:44,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:26:44,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:26:44,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:26:44,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:26:44,253 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:26:44,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 12:26:44,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 12:26:44,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:26:44,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:26:44,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:26:44,408 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:26:44,409 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:26:44,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 12:26:44,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:26:44,618 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 12:26:44,720 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:26:44,724 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:26:44 BoogieIcfgContainer [2025-01-09 12:26:44,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:26:44,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:26:44,726 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:26:44,726 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:26:44,727 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:25:41" (3/4) ... [2025-01-09 12:26:44,728 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:26:44,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:26:44,729 INFO L158 Benchmark]: Toolchain (without parser) took 63668.04ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 132.9MB in the beginning and 793.2MB in the end (delta: -660.3MB). Peak memory consumption was 312.3MB. Max. memory is 16.1GB. [2025-01-09 12:26:44,730 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:26:44,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.40ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 118.4MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:26:44,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.94ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 115.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:26:44,730 INFO L158 Benchmark]: Boogie Preprocessor took 48.47ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 110.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:26:44,730 INFO L158 Benchmark]: RCFGBuilder took 497.57ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 87.9MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:26:44,731 INFO L158 Benchmark]: TraceAbstraction took 62737.70ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 87.5MB in the beginning and 793.5MB in the end (delta: -706.1MB). Peak memory consumption was 270.4MB. Max. memory is 16.1GB. [2025-01-09 12:26:44,731 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 1.1GB. Free memory was 793.5MB in the beginning and 793.2MB in the end (delta: 369.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:26:44,732 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.25ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.40ms. Allocated memory is still 167.8MB. Free memory was 132.4MB in the beginning and 118.4MB in the end (delta: 14.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.94ms. Allocated memory is still 167.8MB. Free memory was 118.4MB in the beginning and 115.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 48.47ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 110.0MB in the end (delta: 5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 497.57ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 87.9MB in the end (delta: 22.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 62737.70ms. Allocated memory was 167.8MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 87.5MB in the beginning and 793.5MB in the end (delta: -706.1MB). Peak memory consumption was 270.4MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 1.1GB. Free memory was 793.5MB in the beginning and 793.2MB in the end (delta: 369.3kB). 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 someBinaryArithmeticDOUBLEoperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryDOUBLEComparisonOperation at line 127. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -64; [L23] signed short int var_1_4 = -10; [L24] signed short int var_1_5 = 100; [L25] double var_1_6 = 0.5; [L26] double var_1_7 = 16.5; [L27] double var_1_8 = 7.4; [L28] unsigned short int var_1_9 = 4; [L29] unsigned char var_1_10 = 0; [L30] unsigned long int var_1_11 = 1000000000; [L31] unsigned short int var_1_12 = 256; [L32] signed short int var_1_13 = 16; [L33] signed short int var_1_14 = 64; [L34] unsigned short int var_1_15 = 63836; [L35] unsigned short int var_1_16 = 10; [L36] signed char var_1_17 = -8; [L37] signed char var_1_18 = 8; [L38] signed short int var_1_19 = 50; [L39] signed short int var_1_20 = 10; [L40] signed short int var_1_21 = 10000; [L41] signed char var_1_22 = -2; [L42] signed long int last_1_var_1_1 = -64; VAL [isInitial=0, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L131] isInitial = 1 [L132] FCALL initially() [L134] CALL updateLastVariables() [L124] last_1_var_1_1 = var_1_1 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-10, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L134] RET updateLastVariables() [L135] CALL updateVariables() [L86] var_1_4 = __VERIFIER_nondet_short() [L87] CALL assume_abort_if_not(var_1_4 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L87] RET assume_abort_if_not(var_1_4 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L88] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L89] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=100, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L90] var_1_5 = __VERIFIER_nondet_short() [L91] CALL assume_abort_if_not(var_1_5 >= -32768) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L91] RET assume_abort_if_not(var_1_5 >= -32768) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] CALL assume_abort_if_not(var_1_5 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L92] RET assume_abort_if_not(var_1_5 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L93] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L93] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_7=33/2, var_1_8=37/5, var_1_9=4] [L94] var_1_7 = __VERIFIER_nondet_double() [L95] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L95] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_8=37/5, var_1_9=4] [L96] var_1_8 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L97] RET assume_abort_if_not((var_1_8 >= -461168.6018427382800e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L98] var_1_10 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L99] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L100] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=16, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L101] var_1_13 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L102] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_13 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L103] RET assume_abort_if_not(var_1_13 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=64, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L104] var_1_14 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L105] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L106] CALL assume_abort_if_not(var_1_14 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L106] RET assume_abort_if_not(var_1_14 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=63836, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L107] var_1_15 = __VERIFIER_nondet_ushort() [L108] CALL assume_abort_if_not(var_1_15 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L108] RET assume_abort_if_not(var_1_15 >= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L109] CALL assume_abort_if_not(var_1_15 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L109] RET assume_abort_if_not(var_1_15 <= 65534) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=10, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L110] var_1_16 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L111] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L112] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L112] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=8, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L113] var_1_18 = __VERIFIER_nondet_char() [L114] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L114] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L115] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=10, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L116] var_1_20 = __VERIFIER_nondet_short() [L117] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L117] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L118] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=10000, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L119] var_1_21 = __VERIFIER_nondet_short() [L120] CALL assume_abort_if_not(var_1_21 >= 8191) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L120] RET assume_abort_if_not(var_1_21 >= 8191) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L121] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=256, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L135] RET updateVariables() [L136] CALL step() [L46] COND TRUE (var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1 [L47] var_1_12 = (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=1000000000, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L49] var_1_11 = (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))))) [L50] unsigned short int stepLocal_3 = var_1_12; [L51] unsigned short int stepLocal_2 = var_1_12; [L52] unsigned short int stepLocal_1 = var_1_12; [L53] unsigned long int stepLocal_0 = var_1_11; VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L54] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_0=3986216790, stepLocal_1=0, stepLocal_2=0, stepLocal_3=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L54] COND TRUE stepLocal_3 <= ((var_1_11 / var_1_4) & 8) [L55] COND FALSE !(-16 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L69] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-8, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L74] var_1_17 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=50, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L75] COND TRUE var_1_13 <= var_1_11 [L76] var_1_19 = ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-2, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L80] var_1_22 = var_1_18 VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-127, var_1_4=-1, var_1_5=1, var_1_6=1/2, var_1_9=4] [L81] COND TRUE var_1_19 <= var_1_1 [L82] var_1_6 = (var_1_7 + var_1_8) VAL [isInitial=1, last_1_var_1_1=-64, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-127, var_1_4=-1, var_1_5=1, var_1_9=4] [L136] RET step() [L137] CALL, EXPR property() [L127] EXPR (var_1_11 / var_1_4) & 8 VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-127, var_1_4=-1, var_1_5=1, var_1_9=4] [L127-L128] return ((((((((var_1_12 <= ((var_1_11 / var_1_4) & 8)) ? ((-16 <= var_1_11) ? ((var_1_12 != (var_1_11 / ((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5))))) ? (var_1_1 == ((signed long int) ((((var_1_11) > (var_1_12)) ? (var_1_11) : (var_1_12))))) : (var_1_1 == ((signed long int) ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) : 1) : ((var_1_11 <= var_1_12) ? (var_1_1 == ((signed long int) var_1_4)) : (var_1_1 == ((signed long int) var_1_11)))) && ((var_1_19 <= var_1_1) ? (var_1_6 == ((double) (var_1_7 + var_1_8))) : 1)) && (var_1_10 ? ((var_1_4 < (var_1_12 + var_1_5)) ? (var_1_9 == ((unsigned short int) 16)) : 1) : 1)) && (var_1_11 == ((unsigned long int) (((((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) < 0 ) ? -((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12)))) : ((((2u) > ((3986216790u - var_1_12))) ? (2u) : ((3986216790u - var_1_12))))))))) && (((var_1_5 * (var_1_13 - var_1_14)) <= last_1_var_1_1) ? (var_1_12 == ((unsigned short int) (var_1_15 - ((((var_1_14) > (var_1_16)) ? (var_1_14) : (var_1_16)))))) : 1)) && (var_1_17 == ((signed char) var_1_18))) && ((var_1_13 <= var_1_11) ? (var_1_19 == ((signed short int) ((var_1_12 + 25) + (var_1_20 - (var_1_21 - 1))))) : (var_1_19 == ((signed short int) ((((((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) > (var_1_12)) ? (((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) : (var_1_12))))))) && (var_1_22 == ((signed char) var_1_18)) ; [L137] RET, EXPR property() [L137] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-127, var_1_4=-1, var_1_5=1, var_1_9=4] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=-64, var_1_10=0, var_1_11=3986216790, var_1_12=0, var_1_13=0, var_1_14=32767, var_1_15=-98305, var_1_16=32766, var_1_17=-127, var_1_18=-127, var_1_19=-64, var_1_1=-64, var_1_20=8101, var_1_21=8191, var_1_22=-127, var_1_4=-1, var_1_5=1, var_1_9=4] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 62.6s, OverallIterations: 5, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 424 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 424 mSDsluCounter, 952 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 505 mSDsCounter, 136 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 387 IncrementalHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 136 mSolverCounterUnsat, 447 mSDtfsCounter, 387 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=4, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 63 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 58.1s InterpolantComputationTime, 1071 NumberOfCodeBlocks, 1071 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 760 ConstructedInterpolants, 0 QuantifiedInterpolants, 6107 SizeOfPredicates, 0 NumberOfNonLiveVariables, 355 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 5 InterpolantComputations, 4 PerfectInterpolantSequences, 5474/5520 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 12:26:44,943 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-01-09 12:26:44,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.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 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:26:47,095 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:26:47,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:26:47,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:26:47,230 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:26:47,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:26:47,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:26:47,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:26:47,265 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:26:47,266 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:26:47,266 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:26:47,266 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:26:47,266 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:26:47,266 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:26:47,266 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:26:47,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:26:47,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:26:47,267 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:26:47,270 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:26:47,270 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:26:47,270 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:26:47,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:26:47,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:26:47,271 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:26:47,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:26:47,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:26:47,272 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:26:47,272 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:26:47,272 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:26:47,272 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 -> 2c89bcd51bf13e1fea060d248b91d9829224d3ab75a99cbb44e94fb17c6b367c [2025-01-09 12:26:47,602 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:26:47,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:26:47,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:26:47,614 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:26:47,617 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:26:47,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i [2025-01-09 12:26:48,903 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36379beaf/0f804e9acc3e4494a4fed5454789cc12/FLAG439b2912b [2025-01-09 12:26:49,180 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:26:49,181 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i [2025-01-09 12:26:49,188 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36379beaf/0f804e9acc3e4494a4fed5454789cc12/FLAG439b2912b [2025-01-09 12:26:49,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/36379beaf/0f804e9acc3e4494a4fed5454789cc12 [2025-01-09 12:26:49,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:26:49,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:26:49,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:26:49,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:26:49,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:26:49,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4582c262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49, skipping insertion in model container [2025-01-09 12:26:49,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,229 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:26:49,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_fillercode_fillercodestructure_normal_file-98.i[913,926] [2025-01-09 12:26:49,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:26:49,466 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:26:49,476 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-98.i[913,926] [2025-01-09 12:26:49,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:26:49,532 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:26:49,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49 WrapperNode [2025-01-09 12:26:49,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:26:49,534 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:26:49,534 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:26:49,534 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:26:49,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,551 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,587 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 138 [2025-01-09 12:26:49,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:26:49,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:26:49,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:26:49,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:26:49,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,626 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 12:26:49,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,630 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,645 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,656 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,663 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:26:49,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:26:49,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:26:49,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:26:49,668 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (1/1) ... [2025-01-09 12:26:49,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:26:49,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:26:49,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 12:26:49,708 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 12:26:49,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:26:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:26:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:26:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:26:49,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:26:49,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:26:49,800 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:26:49,802 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:26:50,702 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 12:26:50,702 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:26:50,710 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:26:50,710 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:26:50,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:26:50 BoogieIcfgContainer [2025-01-09 12:26:50,711 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:26:50,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:26:50,715 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:26:50,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:26:50,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:26:49" (1/3) ... [2025-01-09 12:26:50,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2bb578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:26:50, skipping insertion in model container [2025-01-09 12:26:50,722 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:26:49" (2/3) ... [2025-01-09 12:26:50,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a2bb578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:26:50, skipping insertion in model container [2025-01-09 12:26:50,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:26:50" (3/3) ... [2025-01-09 12:26:50,724 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-98.i [2025-01-09 12:26:50,738 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:26:50,740 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_normal_file-98.i that has 2 procedures, 66 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:26:50,790 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:26:50,801 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;@2f4a7bc7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:26:50,801 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:26:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:26:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 12:26:50,815 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:26:50,816 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:26:50,816 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:26:50,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:26:50,821 INFO L85 PathProgramCache]: Analyzing trace with hash -314878255, now seen corresponding path program 1 times [2025-01-09 12:26:50,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:26:50,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [86909485] [2025-01-09 12:26:50,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:26:50,833 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:26:50,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:26:50,837 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:26:50,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 12:26:50,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 12:26:51,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 12:26:51,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:26:51,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:26:51,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:26:51,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:26:51,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:26:51,383 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:26:51,384 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:26:51,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [86909485] [2025-01-09 12:26:51,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [86909485] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:26:51,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:26:51,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:26:51,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490634352] [2025-01-09 12:26:51,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:26:51,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:26:51,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:26:51,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:26:51,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:26:51,407 INFO L87 Difference]: Start difference. First operand has 66 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 40 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:26:51,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:26:51,959 INFO L93 Difference]: Finished difference Result 170 states and 313 transitions. [2025-01-09 12:26:51,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:26:51,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2025-01-09 12:26:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:26:51,989 INFO L225 Difference]: With dead ends: 170 [2025-01-09 12:26:51,989 INFO L226 Difference]: Without dead ends: 107 [2025-01-09 12:26:51,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:26:51,995 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 89 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:26:51,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 223 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:26:52,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-01-09 12:26:52,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 63. [2025-01-09 12:26:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:26:52,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 94 transitions. [2025-01-09 12:26:52,041 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 94 transitions. Word has length 150 [2025-01-09 12:26:52,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:26:52,043 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 94 transitions. [2025-01-09 12:26:52,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:26:52,043 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 94 transitions. [2025-01-09 12:26:52,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 12:26:52,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:26:52,048 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:26:52,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-01-09 12:26:52,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:26:52,249 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:26:52,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:26:52,250 INFO L85 PathProgramCache]: Analyzing trace with hash -707905265, now seen corresponding path program 1 times [2025-01-09 12:26:52,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:26:52,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [820062276] [2025-01-09 12:26:52,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:26:52,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:26:52,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:26:52,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:26:52,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 12:26:52,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 12:26:52,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 12:26:52,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:26:52,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:26:52,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:26:52,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:26:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:26:52,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:26:52,709 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:26:52,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [820062276] [2025-01-09 12:26:52,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [820062276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:26:52,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:26:52,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:26:52,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652789605] [2025-01-09 12:26:52,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:26:52,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:26:52,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:26:52,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:26:52,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:26:52,714 INFO L87 Difference]: Start difference. First operand 63 states and 94 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:26:54,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:26:54,735 INFO L93 Difference]: Finished difference Result 227 states and 344 transitions. [2025-01-09 12:26:54,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 12:26:54,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 150 [2025-01-09 12:26:54,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:26:54,741 INFO L225 Difference]: With dead ends: 227 [2025-01-09 12:26:54,741 INFO L226 Difference]: Without dead ends: 167 [2025-01-09 12:26:54,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:26:54,742 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 158 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:26:54,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 372 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 12:26:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-01-09 12:26:54,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 119. [2025-01-09 12:26:54,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 68 states have internal predecessors, (84), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 12:26:54,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 180 transitions. [2025-01-09 12:26:54,775 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 180 transitions. Word has length 150 [2025-01-09 12:26:54,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:26:54,775 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 180 transitions. [2025-01-09 12:26:54,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:26:54,775 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 180 transitions. [2025-01-09 12:26:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 12:26:54,781 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:26:54,781 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:26:54,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 12:26:54,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:26:54,982 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:26:54,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:26:54,983 INFO L85 PathProgramCache]: Analyzing trace with hash -706058223, now seen corresponding path program 1 times [2025-01-09 12:26:54,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:26:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364373353] [2025-01-09 12:26:54,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:26:54,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:26:54,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:26:54,986 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 12:26:54,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 12:26:55,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 12:26:55,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 12:26:55,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:26:55,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:26:55,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-09 12:26:55,265 INFO L279 TraceCheckSpWp]: Computing forward predicates...