./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.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_loopvsstraightlinecode_100-while_file-59.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 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:08:30,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:08:30,398 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 13:08:30,409 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:08:30,411 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:08:30,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:08:30,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:08:30,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:08:30,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:08:30,449 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:08:30,449 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:08:30,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:08:30,450 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:08:30,451 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:08:30,451 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:08:30,452 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:08:30,452 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:08:30,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:08:30,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:08:30,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:08:30,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:08:30,452 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:08:30,452 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:08:30,452 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:08:30,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:08:30,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:08:30,452 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:08:30,453 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:08:30,454 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:08:30,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:08:30,454 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 13:08:30,454 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 13:08:30,454 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:08:30,454 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:08:30,455 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:08:30,455 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:08:30,455 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 -> 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 [2025-01-09 13:08:30,768 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:08:30,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:08:30,783 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:08:30,785 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:08:30,785 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:08:30,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2025-01-09 13:08:32,222 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c31a1e01/c7d2739fb6f443daa9ae1a99682ec00c/FLAGb24e4ba38 [2025-01-09 13:08:32,500 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:08:32,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2025-01-09 13:08:32,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c31a1e01/c7d2739fb6f443daa9ae1a99682ec00c/FLAGb24e4ba38 [2025-01-09 13:08:32,792 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7c31a1e01/c7d2739fb6f443daa9ae1a99682ec00c [2025-01-09 13:08:32,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:08:32,796 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:08:32,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:08:32,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:08:32,801 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:08:32,802 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:08:32" (1/1) ... [2025-01-09 13:08:32,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71c4f609 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:32, skipping insertion in model container [2025-01-09 13:08:32,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:08:32" (1/1) ... [2025-01-09 13:08:32,827 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:08:32,971 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_loopvsstraightlinecode_100-while_file-59.i[916,929] [2025-01-09 13:08:33,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:08:33,106 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:08:33,117 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_loopvsstraightlinecode_100-while_file-59.i[916,929] [2025-01-09 13:08:33,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:08:33,196 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:08:33,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33 WrapperNode [2025-01-09 13:08:33,199 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:08:33,200 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:08:33,200 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:08:33,200 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:08:33,206 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,288 INFO L138 Inliner]: procedures = 26, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 254 [2025-01-09 13:08:33,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:08:33,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:08:33,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:08:33,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:08:33,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,310 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,335 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 13:08:33,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,362 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,368 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,392 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:08:33,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:08:33,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:08:33,411 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:08:33,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (1/1) ... [2025-01-09 13:08:33,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:08:33,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:08:33,448 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 13:08:33,453 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 13:08:33,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:08:33,475 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:08:33,475 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:08:33,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 13:08:33,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:08:33,475 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:08:33,561 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:08:33,564 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 13:08:34,174 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2025-01-09 13:08:34,174 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 13:08:34,187 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 13:08:34,188 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 13:08:34,188 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:08:34 BoogieIcfgContainer [2025-01-09 13:08:34,188 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 13:08:34,191 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 13:08:34,191 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 13:08:34,196 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 13:08:34,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 01:08:32" (1/3) ... [2025-01-09 13:08:34,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d7987d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:08:34, skipping insertion in model container [2025-01-09 13:08:34,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:08:33" (2/3) ... [2025-01-09 13:08:34,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d7987d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 01:08:34, skipping insertion in model container [2025-01-09 13:08:34,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:08:34" (3/3) ... [2025-01-09 13:08:34,199 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-59.i [2025-01-09 13:08:34,216 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 13:08:34,219 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-59.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 13:08:34,280 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 13:08:34,295 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;@60a216ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 13:08:34,296 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 13:08:34,301 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 86 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:08:34,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 13:08:34,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:34,315 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:34,316 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:34,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:34,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1685207996, now seen corresponding path program 1 times [2025-01-09 13:08:34,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:34,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223804666] [2025-01-09 13:08:34,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:34,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:34,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 13:08:34,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 13:08:34,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:34,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 13:08:34,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:34,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223804666] [2025-01-09 13:08:34,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223804666] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:08:34,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247248657] [2025-01-09 13:08:34,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:34,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:08:34,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:08:34,662 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 13:08:34,664 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 13:08:34,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 13:08:34,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 13:08:34,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:34,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:34,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 13:08:34,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:08:34,905 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2025-01-09 13:08:34,905 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:08:34,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247248657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:34,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:08:34,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 13:08:34,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427780015] [2025-01-09 13:08:34,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:34,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 13:08:34,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:34,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 13:08:34,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 13:08:34,938 INFO L87 Difference]: Start difference. First operand has 109 states, 85 states have (on average 1.5176470588235293) internal successors, (129), 86 states have internal predecessors, (129), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 13:08:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:34,974 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2025-01-09 13:08:34,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 13:08:34,976 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 148 [2025-01-09 13:08:34,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:34,984 INFO L225 Difference]: With dead ends: 212 [2025-01-09 13:08:34,985 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 13:08:34,989 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 13:08:34,994 INFO L435 NwaCegarLoop]: 165 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, 165 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 13:08:34,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:08:35,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 13:08:35,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 13:08:35,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 83 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-01-09 13:08:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 165 transitions. [2025-01-09 13:08:35,053 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 165 transitions. Word has length 148 [2025-01-09 13:08:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:35,054 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 165 transitions. [2025-01-09 13:08:35,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 13:08:35,055 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 165 transitions. [2025-01-09 13:08:35,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 13:08:35,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:35,059 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:35,071 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 13:08:35,260 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 13:08:35,260 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:35,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:35,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1026947074, now seen corresponding path program 1 times [2025-01-09 13:08:35,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:35,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750846343] [2025-01-09 13:08:35,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:35,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:35,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 13:08:35,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 13:08:35,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:35,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:08:35,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:35,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750846343] [2025-01-09 13:08:35,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750846343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:35,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:08:35,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:08:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83117560] [2025-01-09 13:08:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:35,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:08:35,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:35,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:08:35,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:08:35,632 INFO L87 Difference]: Start difference. First operand 106 states and 165 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:35,750 INFO L93 Difference]: Finished difference Result 309 states and 483 transitions. [2025-01-09 13:08:35,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:08:35,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 148 [2025-01-09 13:08:35,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:35,759 INFO L225 Difference]: With dead ends: 309 [2025-01-09 13:08:35,759 INFO L226 Difference]: Without dead ends: 206 [2025-01-09 13:08:35,760 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 13:08:35,761 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 144 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:35,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 295 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:08:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-01-09 13:08:35,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2025-01-09 13:08:35,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.440251572327044) internal successors, (229), 159 states have internal predecessors, (229), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:08:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 313 transitions. [2025-01-09 13:08:35,804 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 313 transitions. Word has length 148 [2025-01-09 13:08:35,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:35,806 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 313 transitions. [2025-01-09 13:08:35,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 313 transitions. [2025-01-09 13:08:35,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 13:08:35,809 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:35,810 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:35,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 13:08:35,812 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:35,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:35,813 INFO L85 PathProgramCache]: Analyzing trace with hash -395898523, now seen corresponding path program 1 times [2025-01-09 13:08:35,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:35,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009020592] [2025-01-09 13:08:35,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:35,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:35,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 13:08:35,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 13:08:35,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:35,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:08:36,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:36,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009020592] [2025-01-09 13:08:36,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009020592] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:36,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:08:36,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:08:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247902079] [2025-01-09 13:08:36,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:36,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:08:36,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:36,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:08:36,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:08:36,195 INFO L87 Difference]: Start difference. First operand 204 states and 313 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:36,287 INFO L93 Difference]: Finished difference Result 405 states and 623 transitions. [2025-01-09 13:08:36,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:08:36,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 149 [2025-01-09 13:08:36,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:36,295 INFO L225 Difference]: With dead ends: 405 [2025-01-09 13:08:36,296 INFO L226 Difference]: Without dead ends: 204 [2025-01-09 13:08:36,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:08:36,297 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 2 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:36,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 290 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:08:36,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-01-09 13:08:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-01-09 13:08:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 159 states have (on average 1.4276729559748427) internal successors, (227), 159 states have internal predecessors, (227), 42 states have call successors, (42), 2 states have call predecessors, (42), 2 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:08:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 311 transitions. [2025-01-09 13:08:36,328 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 311 transitions. Word has length 149 [2025-01-09 13:08:36,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:36,329 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 311 transitions. [2025-01-09 13:08:36,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:36,329 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 311 transitions. [2025-01-09 13:08:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 13:08:36,331 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:36,331 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:36,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 13:08:36,332 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:36,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:36,332 INFO L85 PathProgramCache]: Analyzing trace with hash -429298594, now seen corresponding path program 1 times [2025-01-09 13:08:36,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:36,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933615514] [2025-01-09 13:08:36,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:36,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:36,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 13:08:36,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 13:08:36,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:36,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:36,735 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:08:36,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:36,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933615514] [2025-01-09 13:08:36,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933615514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:36,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:08:36,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:08:36,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180332174] [2025-01-09 13:08:36,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:36,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:08:36,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:36,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:08:36,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:08:36,740 INFO L87 Difference]: Start difference. First operand 204 states and 311 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:36,980 INFO L93 Difference]: Finished difference Result 717 states and 1095 transitions. [2025-01-09 13:08:36,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:08:36,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2025-01-09 13:08:36,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:36,987 INFO L225 Difference]: With dead ends: 717 [2025-01-09 13:08:36,988 INFO L226 Difference]: Without dead ends: 516 [2025-01-09 13:08:36,989 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 13:08:36,992 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 220 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:36,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 549 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:08:36,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2025-01-09 13:08:37,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 403. [2025-01-09 13:08:37,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 314 states have (on average 1.4267515923566878) internal successors, (448), 314 states have internal predecessors, (448), 84 states have call successors, (84), 4 states have call predecessors, (84), 4 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 13:08:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 616 transitions. [2025-01-09 13:08:37,062 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 616 transitions. Word has length 150 [2025-01-09 13:08:37,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:37,064 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 616 transitions. [2025-01-09 13:08:37,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 616 transitions. [2025-01-09 13:08:37,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 13:08:37,068 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:37,068 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:37,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 13:08:37,069 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:37,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:37,069 INFO L85 PathProgramCache]: Analyzing trace with hash 80174496, now seen corresponding path program 1 times [2025-01-09 13:08:37,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:37,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444662872] [2025-01-09 13:08:37,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:37,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:37,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 13:08:37,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 13:08:37,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:37,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:08:37,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:37,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444662872] [2025-01-09 13:08:37,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444662872] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:37,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:08:37,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 13:08:37,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507955506] [2025-01-09 13:08:37,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:37,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 13:08:37,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:37,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 13:08:37,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:08:37,486 INFO L87 Difference]: Start difference. First operand 403 states and 616 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:37,919 INFO L93 Difference]: Finished difference Result 1025 states and 1565 transitions. [2025-01-09 13:08:37,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 13:08:37,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2025-01-09 13:08:37,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:37,926 INFO L225 Difference]: With dead ends: 1025 [2025-01-09 13:08:37,926 INFO L226 Difference]: Without dead ends: 625 [2025-01-09 13:08:37,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:08:37,928 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 111 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:37,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 481 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 13:08:37,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-01-09 13:08:38,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 621. [2025-01-09 13:08:38,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 488 states have (on average 1.4118852459016393) internal successors, (689), 488 states have internal predecessors, (689), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 13:08:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 941 transitions. [2025-01-09 13:08:38,016 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 941 transitions. Word has length 150 [2025-01-09 13:08:38,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:38,017 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 941 transitions. [2025-01-09 13:08:38,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 941 transitions. [2025-01-09 13:08:38,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 13:08:38,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:38,020 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:38,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 13:08:38,020 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:38,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:38,021 INFO L85 PathProgramCache]: Analyzing trace with hash -853815813, now seen corresponding path program 1 times [2025-01-09 13:08:38,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:38,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74522137] [2025-01-09 13:08:38,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:38,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:38,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 13:08:38,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 13:08:38,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:38,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:38,307 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:08:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:38,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74522137] [2025-01-09 13:08:38,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74522137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:38,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:08:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:08:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680883395] [2025-01-09 13:08:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:38,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:08:38,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:38,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:08:38,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:08:38,311 INFO L87 Difference]: Start difference. First operand 621 states and 941 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:38,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:38,379 INFO L93 Difference]: Finished difference Result 1251 states and 1897 transitions. [2025-01-09 13:08:38,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:08:38,381 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2025-01-09 13:08:38,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:38,389 INFO L225 Difference]: With dead ends: 1251 [2025-01-09 13:08:38,389 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 13:08:38,392 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:08:38,394 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:38,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 475 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 13:08:38,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 13:08:38,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2025-01-09 13:08:38,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 500 states have (on average 1.402) internal successors, (701), 500 states have internal predecessors, (701), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 13:08:38,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 953 transitions. [2025-01-09 13:08:38,486 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 953 transitions. Word has length 150 [2025-01-09 13:08:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:38,487 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 953 transitions. [2025-01-09 13:08:38,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 953 transitions. [2025-01-09 13:08:38,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 13:08:38,490 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:38,490 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:38,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 13:08:38,491 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:38,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:38,491 INFO L85 PathProgramCache]: Analyzing trace with hash -173757443, now seen corresponding path program 1 times [2025-01-09 13:08:38,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:38,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020973564] [2025-01-09 13:08:38,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:38,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:38,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 13:08:38,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 13:08:38,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:38,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:43,524 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:08:43,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:43,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020973564] [2025-01-09 13:08:43,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020973564] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:43,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:08:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 13:08:43,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052592942] [2025-01-09 13:08:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:43,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 13:08:43,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:43,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 13:08:43,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 13:08:43,528 INFO L87 Difference]: Start difference. First operand 633 states and 953 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:46,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:46,080 INFO L93 Difference]: Finished difference Result 1351 states and 2022 transitions. [2025-01-09 13:08:46,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:08:46,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 150 [2025-01-09 13:08:46,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:46,087 INFO L225 Difference]: With dead ends: 1351 [2025-01-09 13:08:46,088 INFO L226 Difference]: Without dead ends: 1146 [2025-01-09 13:08:46,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-01-09 13:08:46,090 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 663 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:46,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 880 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 13:08:46,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-01-09 13:08:46,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 693. [2025-01-09 13:08:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 560 states have (on average 1.4214285714285715) internal successors, (796), 560 states have internal predecessors, (796), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 13:08:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1048 transitions. [2025-01-09 13:08:46,178 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1048 transitions. Word has length 150 [2025-01-09 13:08:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:46,179 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1048 transitions. [2025-01-09 13:08:46,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:46,179 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1048 transitions. [2025-01-09 13:08:46,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 13:08:46,183 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:46,184 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:46,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 13:08:46,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:46,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:46,184 INFO L85 PathProgramCache]: Analyzing trace with hash 613331431, now seen corresponding path program 1 times [2025-01-09 13:08:46,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:46,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656786382] [2025-01-09 13:08:46,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:46,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:46,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 13:08:46,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 13:08:46,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:46,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:46,976 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:08:46,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:46,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656786382] [2025-01-09 13:08:46,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656786382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:46,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:08:46,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 13:08:46,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987763558] [2025-01-09 13:08:46,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:46,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:08:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:46,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:08:46,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 13:08:46,978 INFO L87 Difference]: Start difference. First operand 693 states and 1048 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:47,401 INFO L93 Difference]: Finished difference Result 1574 states and 2375 transitions. [2025-01-09 13:08:47,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:08:47,402 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 151 [2025-01-09 13:08:47,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:47,407 INFO L225 Difference]: With dead ends: 1574 [2025-01-09 13:08:47,408 INFO L226 Difference]: Without dead ends: 884 [2025-01-09 13:08:47,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 13:08:47,410 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 240 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:47,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 386 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 13:08:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2025-01-09 13:08:47,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 755. [2025-01-09 13:08:47,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 622 states have (on average 1.4212218649517685) internal successors, (884), 622 states have internal predecessors, (884), 126 states have call successors, (126), 6 states have call predecessors, (126), 6 states have return successors, (126), 126 states have call predecessors, (126), 126 states have call successors, (126) [2025-01-09 13:08:47,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1136 transitions. [2025-01-09 13:08:47,470 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1136 transitions. Word has length 151 [2025-01-09 13:08:47,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:47,472 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1136 transitions. [2025-01-09 13:08:47,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1136 transitions. [2025-01-09 13:08:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 13:08:47,475 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:47,475 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:47,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 13:08:47,475 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:47,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:47,475 INFO L85 PathProgramCache]: Analyzing trace with hash -170486452, now seen corresponding path program 1 times [2025-01-09 13:08:47,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:47,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726967283] [2025-01-09 13:08:47,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:47,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:47,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 13:08:47,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 13:08:47,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:47,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:50,673 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:08:50,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:50,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726967283] [2025-01-09 13:08:50,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726967283] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:08:50,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756218731] [2025-01-09 13:08:50,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:50,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:08:50,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:08:50,677 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 13:08:50,681 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 13:08:50,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 13:08:50,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 13:08:50,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:50,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:50,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 13:08:50,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:08:50,902 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:08:50,903 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 13:08:50,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756218731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:50,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 13:08:50,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 19 [2025-01-09 13:08:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017279198] [2025-01-09 13:08:50,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:50,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 13:08:50,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:50,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 13:08:50,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-01-09 13:08:50,905 INFO L87 Difference]: Start difference. First operand 755 states and 1136 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:51,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:51,176 INFO L93 Difference]: Finished difference Result 1027 states and 1521 transitions. [2025-01-09 13:08:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 13:08:51,177 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 155 [2025-01-09 13:08:51,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:51,180 INFO L225 Difference]: With dead ends: 1027 [2025-01-09 13:08:51,180 INFO L226 Difference]: Without dead ends: 275 [2025-01-09 13:08:51,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2025-01-09 13:08:51,185 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 225 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:51,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 317 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:08:51,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-01-09 13:08:51,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 264. [2025-01-09 13:08:51,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 217 states have (on average 1.336405529953917) internal successors, (290), 217 states have internal predecessors, (290), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:08:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 374 transitions. [2025-01-09 13:08:51,207 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 374 transitions. Word has length 155 [2025-01-09 13:08:51,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:51,207 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 374 transitions. [2025-01-09 13:08:51,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:51,208 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 374 transitions. [2025-01-09 13:08:51,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 13:08:51,209 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:51,209 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:51,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 13:08:51,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:08:51,410 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:51,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:51,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1598705246, now seen corresponding path program 1 times [2025-01-09 13:08:51,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:51,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915350698] [2025-01-09 13:08:51,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:51,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:51,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 13:08:51,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 13:08:51,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:51,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:08:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:51,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915350698] [2025-01-09 13:08:51,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915350698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:51,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:08:51,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 13:08:51,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560077530] [2025-01-09 13:08:51,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:51,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 13:08:51,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:51,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 13:08:51,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 13:08:51,508 INFO L87 Difference]: Start difference. First operand 264 states and 374 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:51,658 INFO L93 Difference]: Finished difference Result 736 states and 1051 transitions. [2025-01-09 13:08:51,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 13:08:51,659 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 156 [2025-01-09 13:08:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:51,662 INFO L225 Difference]: With dead ends: 736 [2025-01-09 13:08:51,662 INFO L226 Difference]: Without dead ends: 475 [2025-01-09 13:08:51,663 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 13:08:51,664 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 116 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:51,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 255 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 13:08:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-01-09 13:08:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 367. [2025-01-09 13:08:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 320 states have (on average 1.35) internal successors, (432), 320 states have internal predecessors, (432), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:08:51,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 516 transitions. [2025-01-09 13:08:51,691 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 516 transitions. Word has length 156 [2025-01-09 13:08:51,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:51,693 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 516 transitions. [2025-01-09 13:08:51,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:51,694 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 516 transitions. [2025-01-09 13:08:51,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 13:08:51,695 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:51,696 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:51,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 13:08:51,696 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:51,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:51,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1560579201, now seen corresponding path program 1 times [2025-01-09 13:08:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178502206] [2025-01-09 13:08:51,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:51,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 13:08:51,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 13:08:51,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:51,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2025-01-09 13:08:51,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178502206] [2025-01-09 13:08:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178502206] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 13:08:51,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 13:08:51,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 13:08:51,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153450521] [2025-01-09 13:08:51,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 13:08:51,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 13:08:51,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:51,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 13:08:51,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 13:08:51,811 INFO L87 Difference]: Start difference. First operand 367 states and 516 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:52,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:08:52,078 INFO L93 Difference]: Finished difference Result 956 states and 1351 transitions. [2025-01-09 13:08:52,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 13:08:52,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 157 [2025-01-09 13:08:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:08:52,082 INFO L225 Difference]: With dead ends: 956 [2025-01-09 13:08:52,082 INFO L226 Difference]: Without dead ends: 592 [2025-01-09 13:08:52,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 13:08:52,084 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 111 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 13:08:52,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 490 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 13:08:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2025-01-09 13:08:52,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 436. [2025-01-09 13:08:52,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 389 states have (on average 1.3727506426735219) internal successors, (534), 389 states have internal predecessors, (534), 42 states have call successors, (42), 4 states have call predecessors, (42), 4 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:08:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 618 transitions. [2025-01-09 13:08:52,126 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 618 transitions. Word has length 157 [2025-01-09 13:08:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:08:52,126 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 618 transitions. [2025-01-09 13:08:52,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2025-01-09 13:08:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 618 transitions. [2025-01-09 13:08:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 13:08:52,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:08:52,129 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:08:52,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 13:08:52,130 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:08:52,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:08:52,130 INFO L85 PathProgramCache]: Analyzing trace with hash -369997313, now seen corresponding path program 1 times [2025-01-09 13:08:52,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:08:52,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235371329] [2025-01-09 13:08:52,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:08:52,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 13:08:52,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 13:08:52,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:52,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:08:56,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:08:56,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235371329] [2025-01-09 13:08:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235371329] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:08:56,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056996757] [2025-01-09 13:08:56,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:08:56,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:08:56,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:08:56,406 INFO L229 MonitoredProcess]: Starting monitored process 4 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 13:08:56,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 13:08:56,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 13:08:56,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 13:08:56,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:08:56,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:08:56,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 13:08:56,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:08:57,668 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 159 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-01-09 13:08:57,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:08:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056996757] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:08:58,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:08:58,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2025-01-09 13:08:58,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179674705] [2025-01-09 13:08:58,167 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:08:58,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 13:08:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:08:58,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 13:08:58,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-01-09 13:08:58,170 INFO L87 Difference]: Start difference. First operand 436 states and 618 transitions. Second operand has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 13:09:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:01,953 INFO L93 Difference]: Finished difference Result 1271 states and 1754 transitions. [2025-01-09 13:09:01,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-01-09 13:09:01,954 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 157 [2025-01-09 13:09:01,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:01,961 INFO L225 Difference]: With dead ends: 1271 [2025-01-09 13:09:01,962 INFO L226 Difference]: Without dead ends: 838 [2025-01-09 13:09:01,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=482, Invalid=2274, Unknown=0, NotChecked=0, Total=2756 [2025-01-09 13:09:01,965 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 1478 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 1300 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:01,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 457 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1300 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 13:09:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2025-01-09 13:09:02,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 567. [2025-01-09 13:09:02,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 514 states have (on average 1.3249027237354085) internal successors, (681), 514 states have internal predecessors, (681), 42 states have call successors, (42), 10 states have call predecessors, (42), 10 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2025-01-09 13:09:02,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 765 transitions. [2025-01-09 13:09:02,008 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 765 transitions. Word has length 157 [2025-01-09 13:09:02,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:02,008 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 765 transitions. [2025-01-09 13:09:02,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.380952380952381) internal successors, (113), 20 states have internal predecessors, (113), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 13:09:02,009 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 765 transitions. [2025-01-09 13:09:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 13:09:02,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:02,012 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:02,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 13:09:02,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:09:02,212 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:02,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:02,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1518076710, now seen corresponding path program 1 times [2025-01-09 13:09:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:02,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426212508] [2025-01-09 13:09:02,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:02,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 13:09:02,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 13:09:02,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:02,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:05,656 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:09:05,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:05,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426212508] [2025-01-09 13:09:05,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426212508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:09:05,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977561447] [2025-01-09 13:09:05,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:05,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:09:05,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:09:05,658 INFO L229 MonitoredProcess]: Starting monitored process 5 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 13:09:05,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 13:09:05,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 13:09:05,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 13:09:05,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:05,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:05,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 13:09:05,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:09:08,472 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 20 proven. 60 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2025-01-09 13:09:08,472 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:09:12,947 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:09:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977561447] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 13:09:12,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 13:09:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 14] total 37 [2025-01-09 13:09:12,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974641681] [2025-01-09 13:09:12,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 13:09:12,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 13:09:12,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:12,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 13:09:12,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=1096, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 13:09:12,949 INFO L87 Difference]: Start difference. First operand 567 states and 765 transitions. Second operand has 37 states, 37 states have (on average 4.54054054054054) internal successors, (168), 37 states have internal predecessors, (168), 5 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 5 states have call successors, (63) [2025-01-09 13:09:16,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:16,818 INFO L93 Difference]: Finished difference Result 1969 states and 2653 transitions. [2025-01-09 13:09:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-01-09 13:09:16,818 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 4.54054054054054) internal successors, (168), 37 states have internal predecessors, (168), 5 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 5 states have call successors, (63) Word has length 159 [2025-01-09 13:09:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:16,824 INFO L225 Difference]: With dead ends: 1969 [2025-01-09 13:09:16,824 INFO L226 Difference]: Without dead ends: 1553 [2025-01-09 13:09:16,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=581, Invalid=2611, Unknown=0, NotChecked=0, Total=3192 [2025-01-09 13:09:16,827 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 733 mSDsluCounter, 1157 mSDsCounter, 0 mSdLazyCounter, 2819 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 756 SdHoareTripleChecker+Valid, 1262 SdHoareTripleChecker+Invalid, 2873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:16,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [756 Valid, 1262 Invalid, 2873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2819 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-09 13:09:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1553 states. [2025-01-09 13:09:16,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1553 to 1196. [2025-01-09 13:09:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1091 states have (on average 1.3226397800183318) internal successors, (1443), 1091 states have internal predecessors, (1443), 84 states have call successors, (84), 20 states have call predecessors, (84), 20 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-01-09 13:09:16,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 1611 transitions. [2025-01-09 13:09:16,916 INFO L78 Accepts]: Start accepts. Automaton has 1196 states and 1611 transitions. Word has length 159 [2025-01-09 13:09:16,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:16,917 INFO L471 AbstractCegarLoop]: Abstraction has 1196 states and 1611 transitions. [2025-01-09 13:09:16,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 4.54054054054054) internal successors, (168), 37 states have internal predecessors, (168), 5 states have call successors, (63), 3 states have call predecessors, (63), 5 states have return successors, (63), 3 states have call predecessors, (63), 5 states have call successors, (63) [2025-01-09 13:09:16,918 INFO L276 IsEmpty]: Start isEmpty. Operand 1196 states and 1611 transitions. [2025-01-09 13:09:16,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 13:09:16,920 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:16,920 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:16,929 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 13:09:17,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 13:09:17,121 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:17,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:17,121 INFO L85 PathProgramCache]: Analyzing trace with hash -386346970, now seen corresponding path program 1 times [2025-01-09 13:09:17,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:17,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968050923] [2025-01-09 13:09:17,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:17,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:17,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 13:09:17,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 13:09:17,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:17,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:20,544 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 13:09:20,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 13:09:20,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968050923] [2025-01-09 13:09:20,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968050923] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:09:20,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [963482775] [2025-01-09 13:09:20,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:20,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:09:20,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:09:20,547 INFO L229 MonitoredProcess]: Starting monitored process 6 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 13:09:20,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 13:09:20,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 13:09:20,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 13:09:20,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:20,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 13:09:20,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-01-09 13:09:20,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 13:09:21,465 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 136 proven. 159 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2025-01-09 13:09:21,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 13:09:21,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [963482775] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 13:09:21,893 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 13:09:21,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 22 [2025-01-09 13:09:21,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368495391] [2025-01-09 13:09:21,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 13:09:21,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 13:09:21,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 13:09:21,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 13:09:21,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-01-09 13:09:21,895 INFO L87 Difference]: Start difference. First operand 1196 states and 1611 transitions. Second operand has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 21 states have internal predecessors, (117), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 13:09:26,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 13:09:26,133 INFO L93 Difference]: Finished difference Result 2543 states and 3417 transitions. [2025-01-09 13:09:26,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 13:09:26,135 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 21 states have internal predecessors, (117), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) Word has length 159 [2025-01-09 13:09:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 13:09:26,141 INFO L225 Difference]: With dead ends: 2543 [2025-01-09 13:09:26,141 INFO L226 Difference]: Without dead ends: 1350 [2025-01-09 13:09:26,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1085 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=636, Invalid=3524, Unknown=0, NotChecked=0, Total=4160 [2025-01-09 13:09:26,147 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 916 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 2440 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 2507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 13:09:26,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 881 Invalid, 2507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2440 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 13:09:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2025-01-09 13:09:26,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 818. [2025-01-09 13:09:26,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 739 states have (on average 1.3288227334235454) internal successors, (982), 739 states have internal predecessors, (982), 63 states have call successors, (63), 15 states have call predecessors, (63), 15 states have return successors, (63), 63 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 13:09:26,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1108 transitions. [2025-01-09 13:09:26,214 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1108 transitions. Word has length 159 [2025-01-09 13:09:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 13:09:26,215 INFO L471 AbstractCegarLoop]: Abstraction has 818 states and 1108 transitions. [2025-01-09 13:09:26,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.318181818181818) internal successors, (117), 21 states have internal predecessors, (117), 4 states have call successors, (41), 4 states have call predecessors, (41), 6 states have return successors, (42), 4 states have call predecessors, (42), 4 states have call successors, (42) [2025-01-09 13:09:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1108 transitions. [2025-01-09 13:09:26,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 13:09:26,219 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 13:09:26,219 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:09:26,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 13:09:26,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-09 13:09:26,420 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 13:09:26,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 13:09:26,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1215961684, now seen corresponding path program 1 times [2025-01-09 13:09:26,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 13:09:26,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126564493] [2025-01-09 13:09:26,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:26,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 13:09:26,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 13:09:26,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 13:09:26,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:26,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 13:09:26,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1008747508] [2025-01-09 13:09:26,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 13:09:26,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 13:09:26,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:09:26,523 INFO L229 MonitoredProcess]: Starting monitored process 7 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 13:09:26,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 13:09:26,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 13:09:26,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 13:09:26,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:26,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:09:26,712 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 13:09:26,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 13:09:26,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 13:09:26,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 13:09:26,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 13:09:26,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 13:09:26,886 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 13:09:26,887 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 13:09:26,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 13:09:27,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 13:09:27,093 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 13:09:27,203 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 13:09:27,207 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 01:09:27 BoogieIcfgContainer [2025-01-09 13:09:27,207 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 13:09:27,208 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 13:09:27,208 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 13:09:27,208 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 13:09:27,209 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 01:08:34" (3/4) ... [2025-01-09 13:09:27,211 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 13:09:27,211 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 13:09:27,212 INFO L158 Benchmark]: Toolchain (without parser) took 54416.03ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 104.7MB in the beginning and 469.8MB in the end (delta: -365.1MB). Peak memory consumption was 214.1MB. Max. memory is 16.1GB. [2025-01-09 13:09:27,212 INFO L158 Benchmark]: CDTParser took 1.54ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:09:27,213 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.71ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 88.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 13:09:27,213 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.58ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 79.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:09:27,213 INFO L158 Benchmark]: Boogie Preprocessor took 119.15ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 70.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 13:09:27,213 INFO L158 Benchmark]: RCFGBuilder took 779.04ms. Allocated memory is still 142.6MB. Free memory was 70.1MB in the beginning and 97.8MB in the end (delta: -27.7MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2025-01-09 13:09:27,214 INFO L158 Benchmark]: TraceAbstraction took 53016.37ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 97.0MB in the beginning and 470.0MB in the end (delta: -373.0MB). Peak memory consumption was 206.9MB. Max. memory is 16.1GB. [2025-01-09 13:09:27,214 INFO L158 Benchmark]: Witness Printer took 3.75ms. Allocated memory is still 721.4MB. Free memory was 470.0MB in the beginning and 469.8MB in the end (delta: 150.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 13:09:27,215 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.54ms. Allocated memory is still 201.3MB. Free memory is still 125.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 401.71ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 88.0MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.58ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 79.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 119.15ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 70.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 779.04ms. Allocated memory is still 142.6MB. Free memory was 70.1MB in the beginning and 97.8MB in the end (delta: -27.7MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 53016.37ms. Allocated memory was 142.6MB in the beginning and 721.4MB in the end (delta: 578.8MB). Free memory was 97.0MB in the beginning and 470.0MB in the end (delta: -373.0MB). Peak memory consumption was 206.9MB. Max. memory is 16.1GB. * Witness Printer took 3.75ms. Allocated memory is still 721.4MB. Free memory was 470.0MB in the beginning and 469.8MB in the end (delta: 150.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 167, overapproximation of shiftRight at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 157, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryDOUBLEComparisonOperation at line 153, overapproximation of someBinaryDOUBLEComparisonOperation at line 155. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 50; [L23] unsigned char var_1_5 = 200; [L24] unsigned char var_1_6 = 64; [L25] signed short int var_1_7 = -2; [L26] signed long int var_1_8 = 16; [L27] unsigned char var_1_11 = 1; [L28] signed char var_1_12 = 8; [L29] signed char var_1_13 = 0; [L30] signed char var_1_14 = 10; [L31] signed char var_1_15 = 8; [L32] unsigned char var_1_16 = 5; [L33] unsigned char var_1_17 = 100; [L34] unsigned char var_1_18 = 25; [L35] unsigned char var_1_19 = 0; [L36] signed short int var_1_20 = -128; [L37] signed short int var_1_21 = -8; [L38] double var_1_22 = 100000000000.35; [L39] double var_1_23 = 199.4; [L40] double var_1_24 = 63.5; [L41] signed short int var_1_25 = 1; [L42] unsigned char var_1_27 = 1; [L43] unsigned char var_1_28 = 0; [L44] signed short int var_1_29 = -8; [L45] signed long int last_1_var_1_8 = 16; [L46] unsigned char last_1_var_1_16 = 5; VAL [isInitial=0, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L171] isInitial = 1 [L172] FCALL initially() [L174] CALL updateLastVariables() [L163] last_1_var_1_8 = var_1_8 [L164] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=200, var_1_6=64, var_1_7=-2, var_1_8=16] [L174] RET updateLastVariables() [L175] CALL updateVariables() [L128] var_1_5 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_5 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=64, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=64, var_1_7=-2, var_1_8=16] [L129] RET assume_abort_if_not(var_1_5 >= 190) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=64, var_1_7=-2, var_1_8=16] [L130] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=64, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=64, var_1_7=-2, var_1_8=16] [L130] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=64, var_1_7=-2, var_1_8=16] [L131] var_1_6 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_7=-2, var_1_8=16] [L132] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_7=-2, var_1_8=16] [L133] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L133] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=0, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L134] var_1_13 = __VERIFIER_nondet_char() [L135] CALL assume_abort_if_not(var_1_13 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L135] RET assume_abort_if_not(var_1_13 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L136] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L136] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=10, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L137] var_1_14 = __VERIFIER_nondet_char() [L138] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L138] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L139] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L139] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=8, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L140] var_1_15 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L141] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L142] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L142] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=100, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L143] var_1_17 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_17 >= 95) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L144] RET assume_abort_if_not(var_1_17 >= 95) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L145] CALL assume_abort_if_not(var_1_17 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L145] RET assume_abort_if_not(var_1_17 <= 127) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=25, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L146] var_1_18 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L147] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L148] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L148] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=0, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L149] var_1_19 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L150] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L151] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L151] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_22=2000000000007/20, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L152] var_1_22 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L153] RET assume_abort_if_not((var_1_22 >= -922337.2036854776000e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854776000e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_23=997/5, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L154] var_1_23 = __VERIFIER_nondet_double() [L155] CALL assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L155] RET assume_abort_if_not((var_1_23 >= -922337.2036854776000e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854776000e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_24=127/2, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L156] var_1_24 = __VERIFIER_nondet_double() [L157] CALL assume_abort_if_not((var_1_24 >= -922337.2036854776000e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854776000e+12F && var_1_24 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L157] RET assume_abort_if_not((var_1_24 >= -922337.2036854776000e+13F && var_1_24 <= -1.0e-20F) || (var_1_24 <= 9223372.036854776000e+12F && var_1_24 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L158] var_1_28 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L159] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L160] CALL assume_abort_if_not(var_1_28 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L160] RET assume_abort_if_not(var_1_28 <= 0) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=50, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L175] RET updateVariables() [L176] CALL step() [L50] COND TRUE (last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16 [L51] var_1_1 = ((var_1_5 - 2) - var_1_6) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L55] COND TRUE 100.5f < var_1_22 [L56] var_1_27 = (! var_1_28) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=8, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L58] COND TRUE var_1_27 || var_1_27 [L59] var_1_12 = (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L61] signed long int stepLocal_5 = 2; [L62] unsigned char stepLocal_4 = var_1_5; [L63] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_3=1, stepLocal_4=446, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L64] COND FALSE !(stepLocal_4 <= var_1_1) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_3=1, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L67] COND TRUE stepLocal_3 || var_1_27 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_5=2, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=16] [L68] COND TRUE stepLocal_5 < var_1_1 [L69] var_1_8 = var_1_6 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L73] COND FALSE !(! var_1_27) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L80] signed long int stepLocal_2 = ~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))); VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_2=-95, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L81] EXPR var_1_11 >> var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_2=-95, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L81] signed long int stepLocal_1 = var_1_11 >> var_1_1; [L82] unsigned char stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, stepLocal_1=0, stepLocal_2=-95, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L83] COND TRUE var_1_5 >= stepLocal_2 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, stepLocal_1=0, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L84] COND FALSE !(var_1_1 <= stepLocal_1) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=-8, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L94] COND TRUE (var_1_22 * -0.625) < (var_1_23 * var_1_24) [L95] var_1_21 = ((((var_1_13) < ((var_1_12 + (256 - var_1_8)))) ? (var_1_13) : ((var_1_12 + (256 - var_1_8))))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L101] COND FALSE !(var_1_7 > var_1_5) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L106] COND TRUE \read(var_1_27) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L107] COND FALSE !(var_1_29 >= ((var_1_1 + var_1_19) - ((((var_1_1) > (var_1_8)) ? (var_1_1) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=5, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L117] COND TRUE var_1_15 > var_1_25 [L118] var_1_16 = (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L120] EXPR var_1_16 | var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L120] EXPR (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=-128, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L120] signed long int stepLocal_6 = (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))); [L121] COND FALSE !(stepLocal_6 > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) [L124] var_1_20 = ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, stepLocal_0=94, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L176] RET step() [L177] CALL, EXPR property() [L167] EXPR (((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L167] EXPR (var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L167] EXPR var_1_11 >> var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L167] EXPR (var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L167] EXPR (var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L167] EXPR (((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L167] EXPR ((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L167] EXPR var_1_16 | var_1_1 VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L167] EXPR (var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L167] EXPR ((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16)))) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L167-L168] return ((((((((((((last_1_var_1_8 + (last_1_var_1_16 + 4u)) != last_1_var_1_16) ? (var_1_1 == ((unsigned char) ((var_1_5 - 2) - var_1_6))) : (var_1_1 == ((unsigned char) var_1_6))) && ((var_1_5 >= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) ? ((var_1_1 <= (var_1_11 >> var_1_1)) ? ((var_1_1 > (var_1_1 ^ (var_1_5 + var_1_11))) ? (var_1_7 == ((signed short int) ((((var_1_1) < (var_1_6)) ? (var_1_1) : (var_1_6))))) : (var_1_7 == ((signed short int) var_1_1))) : 1) : (var_1_7 == ((signed short int) var_1_1)))) && ((var_1_5 <= var_1_1) ? (var_1_8 == ((signed long int) (var_1_5 - var_1_6))) : ((var_1_27 || var_1_27) ? ((2 < var_1_1) ? (var_1_8 == ((signed long int) var_1_6)) : 1) : 1))) && ((! var_1_27) ? (((var_1_1 >= var_1_1) && var_1_27) ? (var_1_11 == ((unsigned char) ((((var_1_6) < (var_1_5)) ? (var_1_6) : (var_1_5))))) : (var_1_11 == ((unsigned char) var_1_6))) : 1)) && ((var_1_27 || var_1_27) ? (var_1_12 == ((signed char) (var_1_13 + ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))))) : 1)) && ((var_1_15 > var_1_25) ? (var_1_16 == ((unsigned char) (var_1_5 - ((var_1_17 - var_1_18) - var_1_19)))) : 1)) && ((((var_1_16 | var_1_1) & ((((var_1_12) < (var_1_18)) ? (var_1_12) : (var_1_18)))) > (((((var_1_11 * var_1_6)) > (var_1_16)) ? ((var_1_11 * var_1_6)) : (var_1_16)))) ? (var_1_20 == ((signed short int) (var_1_5 - ((((var_1_11) > (1)) ? (var_1_11) : (1)))))) : (var_1_20 == ((signed short int) ((((((var_1_16) < 0 ) ? -(var_1_16) : (var_1_16))) - 10) + 16))))) && (((var_1_22 * -0.625) < (var_1_23 * var_1_24)) ? (var_1_21 == ((signed short int) ((((var_1_13) < ((var_1_12 + (256 - var_1_8)))) ? (var_1_13) : ((var_1_12 + (256 - var_1_8))))))) : (var_1_27 ? (var_1_21 == ((signed short int) (((((((((var_1_12 + -1)) > (var_1_17)) ? ((var_1_12 + -1)) : (var_1_17)))) > ((var_1_13 + var_1_6))) ? ((((((var_1_12 + -1)) > (var_1_17)) ? ((var_1_12 + -1)) : (var_1_17)))) : ((var_1_13 + var_1_6)))))) : 1))) && (var_1_27 ? ((var_1_29 >= ((var_1_1 + var_1_19) - ((((var_1_1) > (var_1_8)) ? (var_1_1) : (var_1_8))))) ? (var_1_27 ? (var_1_25 == ((signed short int) var_1_17)) : (var_1_25 == ((signed short int) var_1_18))) : 1) : (var_1_25 == ((signed short int) var_1_14)))) && ((100.5f < var_1_22) ? (var_1_27 == ((unsigned char) (! var_1_28))) : 1)) && ((var_1_7 > var_1_5) ? (((var_1_21 <= var_1_6) || (var_1_27 || var_1_27)) ? (var_1_29 == ((signed short int) var_1_17)) : 1) : 1) ; [L177] RET, EXPR property() [L177] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=5, last_1_var_1_8=16, var_1_11=1, var_1_12=0, var_1_13=30, var_1_14=-30, var_1_15=63, var_1_16=94, var_1_17=-129, var_1_18=-1249, var_1_19=768, var_1_1=94, var_1_20=100, var_1_21=30, var_1_25=1, var_1_27=1, var_1_28=0, var_1_29=-8, var_1_5=446, var_1_6=862, var_1_7=-2, var_1_8=94] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.8s, OverallIterations: 15, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4986 SdHoareTripleChecker+Valid, 9.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4959 mSDsluCounter, 7183 SdHoareTripleChecker+Invalid, 7.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5065 mSDsCounter, 338 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8399 IncrementalHoareTripleChecker+Invalid, 8737 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 338 mSolverCounterUnsat, 2118 mSDtfsCounter, 8399 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1445 GetRequests, 1215 SyntacticMatches, 3 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2626 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1196occurred in iteration=13, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 14 MinimizatonAttempts, 2136 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 31.6s InterpolantComputationTime, 3241 NumberOfCodeBlocks, 3241 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3056 ConstructedInterpolants, 0 QuantifiedInterpolants, 35392 SizeOfPredicates, 31 NumberOfNonLiveVariables, 1810 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 16106/16800 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 13:09:27,429 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-01-09 13:09:27,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.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 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 13:09:29,564 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 13:09:29,640 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 13:09:29,653 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 13:09:29,653 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 13:09:29,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 13:09:29,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 13:09:29,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 13:09:29,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 13:09:29,680 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 13:09:29,680 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 13:09:29,680 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 13:09:29,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 13:09:29,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 13:09:29,681 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 13:09:29,681 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 13:09:29,681 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 13:09:29,681 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 13:09:29,681 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 13:09:29,681 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 13:09:29,681 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 13:09:29,681 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 13:09:29,681 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 13:09:29,682 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:09:29,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:09:29,682 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:09:29,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 13:09:29,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 13:09:29,684 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 -> 2761ad5b8b5d660ea43c0926578149a1a33205183f80a80f035b1bec4306cb62 [2025-01-09 13:09:29,984 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 13:09:29,993 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 13:09:29,996 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 13:09:29,998 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 13:09:29,998 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 13:09:29,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2025-01-09 13:09:31,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adddf0f43/33b41316063f496fbbce5adee74ba99d/FLAG41837fb9a [2025-01-09 13:09:31,597 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 13:09:31,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-59.i [2025-01-09 13:09:31,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adddf0f43/33b41316063f496fbbce5adee74ba99d/FLAG41837fb9a [2025-01-09 13:09:31,955 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adddf0f43/33b41316063f496fbbce5adee74ba99d [2025-01-09 13:09:31,957 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 13:09:31,958 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 13:09:31,959 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 13:09:31,959 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 13:09:31,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 13:09:31,964 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:09:31" (1/1) ... [2025-01-09 13:09:31,964 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd0f711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:31, skipping insertion in model container [2025-01-09 13:09:31,965 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 01:09:31" (1/1) ... [2025-01-09 13:09:31,990 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 13:09:32,123 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_loopvsstraightlinecode_100-while_file-59.i[916,929] [2025-01-09 13:09:32,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:09:32,215 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 13:09:32,224 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_loopvsstraightlinecode_100-while_file-59.i[916,929] [2025-01-09 13:09:32,277 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 13:09:32,299 INFO L204 MainTranslator]: Completed translation [2025-01-09 13:09:32,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32 WrapperNode [2025-01-09 13:09:32,300 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 13:09:32,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 13:09:32,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 13:09:32,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 13:09:32,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,324 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,358 INFO L138 Inliner]: procedures = 27, calls = 34, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 162 [2025-01-09 13:09:32,359 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 13:09:32,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 13:09:32,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 13:09:32,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 13:09:32,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,408 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 13:09:32,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,435 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,444 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,449 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,456 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 13:09:32,460 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 13:09:32,460 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 13:09:32,461 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 13:09:32,462 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 01:09:32" (1/1) ... [2025-01-09 13:09:32,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 13:09:32,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 13:09:32,497 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 13:09:32,502 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 13:09:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 13:09:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 13:09:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 13:09:32,526 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 13:09:32,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 13:09:32,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 13:09:32,619 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 13:09:32,622 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation