./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-89.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_filler-pr-co_file-89.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 2047f9264b2c920617b53392f40ced93ab41cf01ab4f86874496296bc9dffa93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:35:12,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:35:12,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 11:35:12,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:35:12,300 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:35:12,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:35:12,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:35:12,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:35:12,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:35:12,325 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:35:12,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:35:12,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:35:12,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:35:12,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:35:12,326 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:35:12,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:35:12,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:35:12,328 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:35:12,328 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:35:12,328 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:35:12,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:35:12,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:35:12,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:35:12,329 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:35:12,329 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:35:12,329 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:35:12,329 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:35:12,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:35:12,329 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:35:12,329 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:35:12,329 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:35:12,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:35:12,329 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 11:35:12,329 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 11:35:12,329 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:35:12,330 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:35:12,330 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:35:12,330 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:35:12,330 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 -> 2047f9264b2c920617b53392f40ced93ab41cf01ab4f86874496296bc9dffa93 [2025-01-09 11:35:12,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:35:12,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:35:12,628 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:35:12,629 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:35:12,629 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:35:12,630 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_filler-pr-co_file-89.i [2025-01-09 11:35:13,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0ec3d712/94271e748d54471787939a3c6cf497f7/FLAGb874aaea0 [2025-01-09 11:35:14,098 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:35:14,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-89.i [2025-01-09 11:35:14,106 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0ec3d712/94271e748d54471787939a3c6cf497f7/FLAGb874aaea0 [2025-01-09 11:35:14,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a0ec3d712/94271e748d54471787939a3c6cf497f7 [2025-01-09 11:35:14,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:35:14,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:35:14,122 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:35:14,122 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:35:14,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:35:14,126 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,126 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19341de4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14, skipping insertion in model container [2025-01-09 11:35:14,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:35:14,257 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_filler-pr-co_file-89.i[919,932] [2025-01-09 11:35:14,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:35:14,327 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:35:14,337 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_filler-pr-co_file-89.i[919,932] [2025-01-09 11:35:14,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:35:14,397 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:35:14,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14 WrapperNode [2025-01-09 11:35:14,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:35:14,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:35:14,402 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:35:14,402 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:35:14,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,458 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2025-01-09 11:35:14,464 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:35:14,465 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:35:14,465 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:35:14,465 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:35:14,472 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,475 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,499 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 11:35:14,499 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,510 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,518 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,521 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:35:14,522 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:35:14,522 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:35:14,522 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:35:14,523 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (1/1) ... [2025-01-09 11:35:14,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:35:14,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:35:14,554 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 11:35:14,557 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 11:35:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:35:14,576 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:35:14,576 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:35:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 11:35:14,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:35:14,577 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:35:14,643 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:35:14,645 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:35:14,949 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:35:14,950 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:35:14,961 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:35:14,962 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:35:14,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:35:14 BoogieIcfgContainer [2025-01-09 11:35:14,963 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:35:14,965 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:35:14,965 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:35:14,968 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:35:14,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:35:14" (1/3) ... [2025-01-09 11:35:14,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2569dd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:35:14, skipping insertion in model container [2025-01-09 11:35:14,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:14" (2/3) ... [2025-01-09 11:35:14,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2569dd37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:35:14, skipping insertion in model container [2025-01-09 11:35:14,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:35:14" (3/3) ... [2025-01-09 11:35:14,971 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-89.i [2025-01-09 11:35:14,982 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:35:14,983 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-89.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:35:15,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:35:15,038 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;@6e1f613f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:35:15,038 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:35:15,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 60 states have internal predecessors, (91), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:35:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 11:35:15,052 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:15,053 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:15,053 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:15,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:15,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1301676331, now seen corresponding path program 1 times [2025-01-09 11:35:15,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:15,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343294340] [2025-01-09 11:35:15,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:15,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:15,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 11:35:15,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 11:35:15,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:15,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:15,319 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 11:35:15,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:15,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343294340] [2025-01-09 11:35:15,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343294340] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 11:35:15,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037077321] [2025-01-09 11:35:15,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:15,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:35:15,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:35:15,325 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 11:35:15,327 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 11:35:15,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 11:35:15,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 11:35:15,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:15,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:15,473 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:35:15,500 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:35:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2025-01-09 11:35:15,519 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:35:15,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037077321] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:15,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 11:35:15,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 11:35:15,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131884694] [2025-01-09 11:35:15,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:15,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:35:15,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:15,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:35:15,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:35:15,539 INFO L87 Difference]: Start difference. First operand has 84 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 60 states have internal predecessors, (91), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:35:15,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:15,556 INFO L93 Difference]: Finished difference Result 162 states and 287 transitions. [2025-01-09 11:35:15,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:35:15,558 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 148 [2025-01-09 11:35:15,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:15,562 INFO L225 Difference]: With dead ends: 162 [2025-01-09 11:35:15,563 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 11:35:15,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 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 11:35:15,567 INFO L435 NwaCegarLoop]: 130 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, 130 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 11:35:15,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:35:15,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 11:35:15,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 11:35:15,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 57 states have (on average 1.5087719298245614) internal successors, (86), 57 states have internal predecessors, (86), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:35:15,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 130 transitions. [2025-01-09 11:35:15,605 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 130 transitions. Word has length 148 [2025-01-09 11:35:15,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:15,606 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 130 transitions. [2025-01-09 11:35:15,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:35:15,606 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 130 transitions. [2025-01-09 11:35:15,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 11:35:15,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:15,609 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:15,615 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 11:35:15,813 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 11:35:15,813 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:15,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:15,814 INFO L85 PathProgramCache]: Analyzing trace with hash -301315349, now seen corresponding path program 1 times [2025-01-09 11:35:15,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:15,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971942724] [2025-01-09 11:35:15,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:15,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:15,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 11:35:15,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 11:35:15,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:15,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:16,047 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:35:16,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:16,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971942724] [2025-01-09 11:35:16,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971942724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:16,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:16,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:35:16,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258513646] [2025-01-09 11:35:16,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:16,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:35:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:16,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:35:16,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:35:16,051 INFO L87 Difference]: Start difference. First operand 81 states and 130 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:16,138 INFO L93 Difference]: Finished difference Result 231 states and 372 transitions. [2025-01-09 11:35:16,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:35:16,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-01-09 11:35:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:16,140 INFO L225 Difference]: With dead ends: 231 [2025-01-09 11:35:16,140 INFO L226 Difference]: Without dead ends: 153 [2025-01-09 11:35:16,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:35:16,142 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 99 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:16,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 291 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 11:35:16,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-01-09 11:35:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 149. [2025-01-09 11:35:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 102 states have (on average 1.4313725490196079) internal successors, (146), 102 states have internal predecessors, (146), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 11:35:16,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 234 transitions. [2025-01-09 11:35:16,162 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 234 transitions. Word has length 148 [2025-01-09 11:35:16,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:16,162 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 234 transitions. [2025-01-09 11:35:16,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 234 transitions. [2025-01-09 11:35:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 11:35:16,164 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:16,164 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:16,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 11:35:16,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:16,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash 960509739, now seen corresponding path program 1 times [2025-01-09 11:35:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740568412] [2025-01-09 11:35:16,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:16,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:16,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 11:35:16,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 11:35:16,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:16,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:16,273 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:35:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740568412] [2025-01-09 11:35:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740568412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:16,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:16,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:35:16,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622787771] [2025-01-09 11:35:16,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:16,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:35:16,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:16,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:35:16,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:35:16,279 INFO L87 Difference]: Start difference. First operand 149 states and 234 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:16,368 INFO L93 Difference]: Finished difference Result 305 states and 481 transitions. [2025-01-09 11:35:16,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:35:16,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-01-09 11:35:16,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:16,370 INFO L225 Difference]: With dead ends: 305 [2025-01-09 11:35:16,371 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 11:35:16,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:35:16,372 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 96 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:16,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 226 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:35:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 11:35:16,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2025-01-09 11:35:16,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 108 states have internal predecessors, (150), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 11:35:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 238 transitions. [2025-01-09 11:35:16,398 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 238 transitions. Word has length 148 [2025-01-09 11:35:16,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:16,398 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 238 transitions. [2025-01-09 11:35:16,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:16,399 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 238 transitions. [2025-01-09 11:35:16,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 11:35:16,400 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:16,400 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:16,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 11:35:16,400 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:16,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:16,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1368706021, now seen corresponding path program 1 times [2025-01-09 11:35:16,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:16,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714191897] [2025-01-09 11:35:16,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:16,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:16,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 11:35:16,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 11:35:16,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:16,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:16,723 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:35:16,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:16,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714191897] [2025-01-09 11:35:16,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714191897] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:16,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:16,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 11:35:16,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354790348] [2025-01-09 11:35:16,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:16,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 11:35:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:16,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 11:35:16,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 11:35:16,727 INFO L87 Difference]: Start difference. First operand 155 states and 238 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:16,929 INFO L93 Difference]: Finished difference Result 461 states and 712 transitions. [2025-01-09 11:35:16,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 11:35:16,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-01-09 11:35:16,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:16,935 INFO L225 Difference]: With dead ends: 461 [2025-01-09 11:35:16,935 INFO L226 Difference]: Without dead ends: 309 [2025-01-09 11:35:16,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 11:35:16,939 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 74 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:16,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 269 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 11:35:16,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2025-01-09 11:35:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 303. [2025-01-09 11:35:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 210 states have (on average 1.380952380952381) internal successors, (290), 210 states have internal predecessors, (290), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 11:35:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 466 transitions. [2025-01-09 11:35:17,014 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 466 transitions. Word has length 148 [2025-01-09 11:35:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:17,015 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 466 transitions. [2025-01-09 11:35:17,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 466 transitions. [2025-01-09 11:35:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 11:35:17,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:17,017 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:17,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 11:35:17,017 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:17,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:17,019 INFO L85 PathProgramCache]: Analyzing trace with hash -2116914649, now seen corresponding path program 1 times [2025-01-09 11:35:17,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:17,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171467318] [2025-01-09 11:35:17,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:17,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:17,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 11:35:17,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 11:35:17,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:17,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:17,620 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:35:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171467318] [2025-01-09 11:35:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171467318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:17,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:17,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 11:35:17,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344383069] [2025-01-09 11:35:17,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:17,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 11:35:17,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:17,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 11:35:17,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 11:35:17,621 INFO L87 Difference]: Start difference. First operand 303 states and 466 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:17,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:17,970 INFO L93 Difference]: Finished difference Result 765 states and 1172 transitions. [2025-01-09 11:35:17,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 11:35:17,971 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-01-09 11:35:17,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:17,978 INFO L225 Difference]: With dead ends: 765 [2025-01-09 11:35:17,978 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 11:35:17,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 11:35:17,980 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 372 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:17,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 472 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 11:35:17,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 11:35:18,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 335. [2025-01-09 11:35:18,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 242 states have (on average 1.4049586776859504) internal successors, (340), 242 states have internal predecessors, (340), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 11:35:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 516 transitions. [2025-01-09 11:35:18,035 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 516 transitions. Word has length 148 [2025-01-09 11:35:18,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:18,037 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 516 transitions. [2025-01-09 11:35:18,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:18,037 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 516 transitions. [2025-01-09 11:35:18,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 11:35:18,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:18,041 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:18,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 11:35:18,041 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:18,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:18,042 INFO L85 PathProgramCache]: Analyzing trace with hash -204732053, now seen corresponding path program 1 times [2025-01-09 11:35:18,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:18,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21796085] [2025-01-09 11:35:18,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:18,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:18,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 11:35:18,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 11:35:18,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:18,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:35:18,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 11:35:18,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21796085] [2025-01-09 11:35:18,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21796085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:18,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:18,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 11:35:18,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135653572] [2025-01-09 11:35:18,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:18,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:35:18,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 11:35:18,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:35:18,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:35:18,132 INFO L87 Difference]: Start difference. First operand 335 states and 516 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:18,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:18,184 INFO L93 Difference]: Finished difference Result 671 states and 1037 transitions. [2025-01-09 11:35:18,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:35:18,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 149 [2025-01-09 11:35:18,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:18,187 INFO L225 Difference]: With dead ends: 671 [2025-01-09 11:35:18,187 INFO L226 Difference]: Without dead ends: 339 [2025-01-09 11:35:18,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:35:18,189 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:18,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 226 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:35:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-01-09 11:35:18,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2025-01-09 11:35:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 246 states have (on average 1.3983739837398375) internal successors, (344), 246 states have internal predecessors, (344), 88 states have call successors, (88), 4 states have call predecessors, (88), 4 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2025-01-09 11:35:18,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 520 transitions. [2025-01-09 11:35:18,213 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 520 transitions. Word has length 149 [2025-01-09 11:35:18,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:18,213 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 520 transitions. [2025-01-09 11:35:18,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:18,214 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 520 transitions. [2025-01-09 11:35:18,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 11:35:18,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:18,215 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:18,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 11:35:18,215 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:18,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:18,215 INFO L85 PathProgramCache]: Analyzing trace with hash 604614573, now seen corresponding path program 1 times [2025-01-09 11:35:18,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 11:35:18,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623199704] [2025-01-09 11:35:18,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:18,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 11:35:18,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 11:35:18,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 11:35:18,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:18,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 11:35:18,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990788063] [2025-01-09 11:35:18,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:18,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:35:18,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:35:18,289 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 11:35:18,291 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 11:35:18,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 11:35:18,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 11:35:18,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:18,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:35:18,393 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 11:35:18,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 11:35:18,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 11:35:18,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:18,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 11:35:18,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 11:35:18,519 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 11:35:18,520 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 11:35:18,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 11:35:18,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 11:35:18,724 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 11:35:18,838 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 11:35:18,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 11:35:18 BoogieIcfgContainer [2025-01-09 11:35:18,843 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 11:35:18,843 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 11:35:18,843 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 11:35:18,843 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 11:35:18,844 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:35:14" (3/4) ... [2025-01-09 11:35:18,846 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 11:35:18,847 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 11:35:18,847 INFO L158 Benchmark]: Toolchain (without parser) took 4726.95ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 123.7MB in the beginning and 126.7MB in the end (delta: -3.1MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2025-01-09 11:35:18,847 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:35:18,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.27ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 108.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 11:35:18,848 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.58ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 103.9MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:35:18,848 INFO L158 Benchmark]: Boogie Preprocessor took 56.53ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 98.0MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 11:35:18,848 INFO L158 Benchmark]: RCFGBuilder took 441.54ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 71.7MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 11:35:18,848 INFO L158 Benchmark]: TraceAbstraction took 3877.97ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 70.8MB in the beginning and 126.8MB in the end (delta: -56.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:35:18,848 INFO L158 Benchmark]: Witness Printer took 3.68ms. Allocated memory is still 209.7MB. Free memory was 126.8MB in the beginning and 126.7MB in the end (delta: 64.6kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 11:35:18,849 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.23ms. Allocated memory is still 201.3MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.27ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 108.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.58ms. Allocated memory is still 167.8MB. Free memory was 108.0MB in the beginning and 103.9MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 56.53ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 98.0MB in the end (delta: 5.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 441.54ms. Allocated memory is still 167.8MB. Free memory was 98.0MB in the beginning and 71.7MB in the end (delta: 26.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3877.97ms. Allocated memory was 167.8MB in the beginning and 209.7MB in the end (delta: 41.9MB). Free memory was 70.8MB in the beginning and 126.8MB in the end (delta: -56.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.68ms. Allocated memory is still 209.7MB. Free memory was 126.8MB in the beginning and 126.7MB in the end (delta: 64.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 180, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryDOUBLEComparisonOperation at line 165. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 32; [L23] unsigned char var_1_4 = 0; [L24] unsigned short int var_1_8 = 32; [L25] signed long int var_1_9 = -16; [L26] unsigned short int var_1_10 = 5; [L27] unsigned char var_1_12 = 32; [L28] unsigned char var_1_13 = 1; [L29] unsigned char var_1_14 = 0; [L30] unsigned char var_1_15 = 0; [L31] double var_1_16 = 63.75; [L32] double var_1_17 = 8.5; [L33] signed short int var_1_18 = -64; [L34] unsigned char var_1_19 = 32; [L35] unsigned char var_1_23 = 16; [L36] signed short int var_1_24 = -1; [L37] signed short int var_1_25 = 2; [L38] unsigned char var_1_26 = 100; [L39] unsigned char var_1_29 = 128; [L40] unsigned char var_1_30 = 64; [L41] signed char var_1_31 = -1; [L42] unsigned short int var_1_32 = 100; [L43] unsigned long int var_1_33 = 0; [L44] float var_1_36 = 16.8; [L45] signed char var_1_38 = 0; [L46] signed long int var_1_39 = -4; [L47] unsigned short int var_1_40 = 256; [L48] signed long int last_1_var_1_1 = 32; [L49] unsigned char last_1_var_1_12 = 32; [L50] signed short int last_1_var_1_18 = -64; VAL [isInitial=0, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L192] isInitial = 1 [L193] FCALL initially() [L195] CALL updateLastVariables() [L183] last_1_var_1_1 = var_1_1 [L184] last_1_var_1_12 = var_1_12 [L185] last_1_var_1_18 = var_1_18 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L195] RET updateLastVariables() [L196] CALL updateVariables() [L148] var_1_4 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L149] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_8=32, var_1_9=-16] [L150] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L150] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=-16] [L151] var_1_9 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_9 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L152] RET assume_abort_if_not(var_1_9 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L153] CALL assume_abort_if_not(var_1_9 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L153] RET assume_abort_if_not(var_1_9 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L154] CALL assume_abort_if_not(var_1_9 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L154] RET assume_abort_if_not(var_1_9 != 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=5, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L155] var_1_10 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L156] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L157] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L157] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=1, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L158] var_1_13 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L159] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L160] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L160] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L161] var_1_15 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L162] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L163] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L163] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_17=17/2, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L164] var_1_17 = __VERIFIER_nondet_double() [L165] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L165] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=16, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L166] var_1_23 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L168] CALL assume_abort_if_not(var_1_23 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L168] RET assume_abort_if_not(var_1_23 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=2, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L169] var_1_25 = __VERIFIER_nondet_short() [L170] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L170] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L171] CALL assume_abort_if_not(var_1_25 <= 9) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L171] RET assume_abort_if_not(var_1_25 <= 9) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=128, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L172] var_1_29 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_29 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L173] RET assume_abort_if_not(var_1_29 >= 127) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L174] CALL assume_abort_if_not(var_1_29 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L174] RET assume_abort_if_not(var_1_29 <= 254) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=64, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L175] var_1_30 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_30 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L176] RET assume_abort_if_not(var_1_30 >= 63) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L177] CALL assume_abort_if_not(var_1_30 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L177] RET assume_abort_if_not(var_1_30 <= 127) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_36=84/5, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L178] var_1_36 = __VERIFIER_nondet_float() [L179] CALL assume_abort_if_not((var_1_36 >= -922337.2036854776000e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L179] RET assume_abort_if_not((var_1_36 >= -922337.2036854776000e+13F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854776000e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L180] CALL assume_abort_if_not(var_1_36 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L180] RET assume_abort_if_not(var_1_36 != 0.0F) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L196] RET updateVariables() [L197] CALL step() [L54] signed long int stepLocal_1 = last_1_var_1_18; [L55] signed long int stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_1=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L56] COND FALSE !(stepLocal_1 >= (last_1_var_1_18 / var_1_9)) [L63] var_1_8 = last_1_var_1_12 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L65] COND FALSE !(var_1_14 && var_1_14) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=-64, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L68] var_1_38 = var_1_25 [L69] var_1_18 = var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L70] EXPR var_1_1 >> ((((var_1_25) < (1)) ? (var_1_25) : (1))) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L70] COND FALSE !(((((var_1_18) < (25)) ? (var_1_18) : (25))) > (var_1_1 >> ((((var_1_25) < (1)) ? (var_1_25) : (1))))) [L77] COND FALSE !(var_1_10 < var_1_18) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L88] unsigned short int stepLocal_2 = var_1_8; VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, stepLocal_2=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L89] COND FALSE !(stepLocal_2 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L100] COND FALSE !(var_1_23 > var_1_8) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L105] COND FALSE !(var_1_18 != var_1_12) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=-4, var_1_40=256, var_1_4=0, var_1_8=32, var_1_9=64] [L110] var_1_39 = var_1_30 [L111] var_1_40 = var_1_30 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L112] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=255/4, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L119] COND FALSE !(\read(var_1_14)) [L122] var_1_16 = var_1_17 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L125] EXPR var_1_12 & var_1_8 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=32, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L125] COND TRUE (var_1_12 & var_1_8) >= var_1_8 [L126] var_1_19 = var_1_23 VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L128] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L133] COND FALSE !(var_1_14 && var_1_14) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L142] COND FALSE !(\read(var_1_14)) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, stepLocal_0=-64, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return ((((((var_1_18 != var_1_12) ? (var_1_14 ? (var_1_1 == ((signed long int) ((((((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) < (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18))))) ? (((((-5) > (var_1_12)) ? (-5) : (var_1_12)))) : (((((var_1_8) < (var_1_18)) ? (var_1_8) : (var_1_18)))))))) : 1) : 1) && ((last_1_var_1_18 >= (last_1_var_1_18 / var_1_9)) ? ((last_1_var_1_18 < (last_1_var_1_1 * 256)) ? (var_1_8 == ((unsigned short int) ((((last_1_var_1_12) < (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12))))) ? (last_1_var_1_12) : (((((128) < (last_1_var_1_12)) ? (128) : (last_1_var_1_12)))))))) : (var_1_8 == ((unsigned short int) last_1_var_1_12))) : (var_1_8 == ((unsigned short int) last_1_var_1_12)))) && ((var_1_10 < var_1_18) ? ((last_1_var_1_12 <= (5 - last_1_var_1_12)) ? (var_1_12 == ((unsigned char) var_1_13)) : ((last_1_var_1_12 == var_1_8) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) var_1_13)))) : 1)) && ((var_1_8 > (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) + var_1_12)) ? ((! (var_1_8 >= var_1_12)) ? (var_1_4 ? (var_1_14 == ((unsigned char) 0)) : (var_1_14 == ((unsigned char) var_1_15))) : (var_1_14 == ((unsigned char) var_1_15))) : 1)) && (var_1_14 ? (var_1_15 ? (var_1_16 == ((double) var_1_17)) : (var_1_16 == ((double) (((((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) > (var_1_17)) ? ((((((25.8) > (7.5)) ? (25.8) : (7.5))) - 50.25)) : (var_1_17)))))) : (var_1_14 ? (var_1_16 == ((double) 5.2)) : (var_1_16 == ((double) var_1_17))))) && (var_1_18 == ((signed short int) var_1_8)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=32, last_1_var_1_18=-64, last_1_var_1_1=32, var_1_10=32, var_1_12=32, var_1_13=0, var_1_14=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=32, var_1_19=0, var_1_1=32, var_1_23=0, var_1_24=-1, var_1_25=0, var_1_26=100, var_1_29=127, var_1_30=63, var_1_31=-1, var_1_32=100, var_1_33=0, var_1_38=0, var_1_39=63, var_1_40=63, var_1_4=0, var_1_8=32, var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 641 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 641 mSDsluCounter, 1614 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 842 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 339 IncrementalHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 772 mSDtfsCounter, 339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=339occurred in iteration=6, 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, 6 MinimizatonAttempts, 144 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1335 NumberOfCodeBlocks, 1335 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1030 ConstructedInterpolants, 0 QuantifiedInterpolants, 1735 SizeOfPredicates, 0 NumberOfNonLiveVariables, 355 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 7 InterpolantComputations, 6 PerfectInterpolantSequences, 6426/6468 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 11:35:18,872 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-89.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 2047f9264b2c920617b53392f40ced93ab41cf01ab4f86874496296bc9dffa93 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 11:35:20,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 11:35:20,740 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 11:35:20,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 11:35:20,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 11:35:20,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 11:35:20,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 11:35:20,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 11:35:20,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 11:35:20,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 11:35:20,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 11:35:20,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 11:35:20,777 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 11:35:20,777 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 11:35:20,777 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 11:35:20,777 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 11:35:20,777 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 11:35:20,778 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 11:35:20,779 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 11:35:20,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:35:20,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:35:20,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:35:20,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:35:20,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 11:35:20,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 11:35:20,779 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 11:35:20,779 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 11:35:20,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:35:20,779 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 11:35:20,779 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 11:35:20,779 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 11:35:20,780 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 11:35:20,780 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 11:35:20,780 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 11:35:20,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 11:35:20,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 11:35:20,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 11:35:20,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 11:35:20,780 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 -> 2047f9264b2c920617b53392f40ced93ab41cf01ab4f86874496296bc9dffa93 [2025-01-09 11:35:21,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 11:35:21,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 11:35:21,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 11:35:21,014 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 11:35:21,014 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 11:35:21,015 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_filler-pr-co_file-89.i [2025-01-09 11:35:22,193 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee698d219/39d89adbc0de4c7f96ab73f3d9243769/FLAGb05534a7c [2025-01-09 11:35:22,411 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 11:35:22,412 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-co_file-89.i [2025-01-09 11:35:22,419 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee698d219/39d89adbc0de4c7f96ab73f3d9243769/FLAGb05534a7c [2025-01-09 11:35:22,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ee698d219/39d89adbc0de4c7f96ab73f3d9243769 [2025-01-09 11:35:22,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 11:35:22,773 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 11:35:22,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 11:35:22,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 11:35:22,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 11:35:22,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:22,778 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f07375 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22, skipping insertion in model container [2025-01-09 11:35:22,778 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:22,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 11:35:22,883 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_filler-pr-co_file-89.i[919,932] [2025-01-09 11:35:22,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:35:22,948 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 11:35:22,956 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_filler-pr-co_file-89.i[919,932] [2025-01-09 11:35:22,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 11:35:22,997 INFO L204 MainTranslator]: Completed translation [2025-01-09 11:35:22,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22 WrapperNode [2025-01-09 11:35:22,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 11:35:22,998 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 11:35:22,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 11:35:22,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 11:35:23,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,014 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,042 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 173 [2025-01-09 11:35:23,042 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 11:35:23,047 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 11:35:23,047 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 11:35:23,047 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 11:35:23,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,085 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 11:35:23,085 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,085 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,105 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,110 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,111 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 11:35:23,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 11:35:23,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 11:35:23,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 11:35:23,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (1/1) ... [2025-01-09 11:35:23,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 11:35:23,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 11:35:23,141 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 11:35:23,143 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 11:35:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 11:35:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 11:35:23,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 11:35:23,161 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 11:35:23,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 11:35:23,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 11:35:23,241 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 11:35:23,243 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 11:35:32,340 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 11:35:32,340 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 11:35:32,350 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 11:35:32,350 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 11:35:32,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:35:32 BoogieIcfgContainer [2025-01-09 11:35:32,350 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 11:35:32,351 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 11:35:32,352 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 11:35:32,355 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 11:35:32,355 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:35:22" (1/3) ... [2025-01-09 11:35:32,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1645b9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:35:32, skipping insertion in model container [2025-01-09 11:35:32,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:35:22" (2/3) ... [2025-01-09 11:35:32,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1645b9aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:35:32, skipping insertion in model container [2025-01-09 11:35:32,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:35:32" (3/3) ... [2025-01-09 11:35:32,357 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-89.i [2025-01-09 11:35:32,366 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 11:35:32,371 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pr-co_file-89.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 11:35:32,412 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 11:35:32,419 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;@20dd9226, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 11:35:32,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 11:35:32,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:35:32,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 11:35:32,431 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:32,431 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:32,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:32,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:32,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2006185891, now seen corresponding path program 1 times [2025-01-09 11:35:32,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:35:32,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1307850826] [2025-01-09 11:35:32,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:32,443 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 11:35:32,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:35:32,445 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 11:35:32,446 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 11:35:32,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 11:35:32,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 11:35:32,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:32,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:32,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 11:35:32,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:35:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 434 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-01-09 11:35:32,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:35:32,738 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:35:32,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1307850826] [2025-01-09 11:35:32,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1307850826] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:32,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:32,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:35:32,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253223679] [2025-01-09 11:35:32,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:32,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 11:35:32,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:35:32,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 11:35:32,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 11:35:32,758 INFO L87 Difference]: Start difference. First operand has 79 states, 54 states have (on average 1.537037037037037) internal successors, (83), 55 states have internal predecessors, (83), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:35:32,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:32,785 INFO L93 Difference]: Finished difference Result 152 states and 271 transitions. [2025-01-09 11:35:32,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 11:35:32,788 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2025-01-09 11:35:32,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:32,793 INFO L225 Difference]: With dead ends: 152 [2025-01-09 11:35:32,794 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 11:35:32,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 145 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 11:35:32,800 INFO L435 NwaCegarLoop]: 122 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, 122 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 11:35:32,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 11:35:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 11:35:32,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-09 11:35:32,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 52 states have (on average 1.5) internal successors, (78), 52 states have internal predecessors, (78), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-01-09 11:35:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2025-01-09 11:35:32,841 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 122 transitions. Word has length 146 [2025-01-09 11:35:32,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:32,841 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 122 transitions. [2025-01-09 11:35:32,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2025-01-09 11:35:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 122 transitions. [2025-01-09 11:35:32,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 11:35:32,843 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:32,843 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:32,853 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 11:35:33,044 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 11:35:33,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:33,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:33,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1208988003, now seen corresponding path program 1 times [2025-01-09 11:35:33,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:35:33,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1245888291] [2025-01-09 11:35:33,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:33,046 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 11:35:33,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:35:33,048 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 11:35:33,048 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 11:35:33,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 11:35:33,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 11:35:33,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:33,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:33,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 11:35:33,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 11:35:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 11:35:35,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 11:35:35,726 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 11:35:35,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1245888291] [2025-01-09 11:35:35,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1245888291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 11:35:35,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 11:35:35,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 11:35:35,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702816940] [2025-01-09 11:35:35,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 11:35:35,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 11:35:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 11:35:35,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 11:35:35,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 11:35:35,729 INFO L87 Difference]: Start difference. First operand 76 states and 122 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:36,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 11:35:36,131 INFO L93 Difference]: Finished difference Result 216 states and 348 transitions. [2025-01-09 11:35:36,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 11:35:36,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 146 [2025-01-09 11:35:36,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 11:35:36,133 INFO L225 Difference]: With dead ends: 216 [2025-01-09 11:35:36,133 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 11:35:36,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 144 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 11:35:36,134 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 31 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 11:35:36,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 211 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 11:35:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 11:35:36,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2025-01-09 11:35:36,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 92 states have internal predecessors, (129), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2025-01-09 11:35:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 217 transitions. [2025-01-09 11:35:36,152 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 217 transitions. Word has length 146 [2025-01-09 11:35:36,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 11:35:36,152 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 217 transitions. [2025-01-09 11:35:36,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 11:35:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 217 transitions. [2025-01-09 11:35:36,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 11:35:36,154 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 11:35:36,154 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:36,162 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 11:35:36,354 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 11:35:36,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 11:35:36,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 11:35:36,355 INFO L85 PathProgramCache]: Analyzing trace with hash 200102631, now seen corresponding path program 1 times [2025-01-09 11:35:36,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 11:35:36,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018255263] [2025-01-09 11:35:36,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 11:35:36,355 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 11:35:36,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 11:35:36,357 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 11:35:36,358 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 11:35:36,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 11:35:36,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 11:35:36,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 11:35:36,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 11:35:36,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-01-09 11:35:36,603 INFO L279 TraceCheckSpWp]: Computing forward predicates...