./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.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 e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:36:53,183 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:36:53,233 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:36:53,238 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:36:53,241 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:36:53,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:36:53,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:36:53,266 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:36:53,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:36:53,266 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:36:53,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:36:53,267 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:36:53,267 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:36:53,268 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:36:53,268 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:36:53,268 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:36:53,268 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:36:53,268 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:36:53,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:36:53,269 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:36:53,269 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:36:53,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:36:53,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:36:53,270 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:36:53,270 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:36:53,270 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:36:53,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:36:53,270 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:36:53,270 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:36:53,270 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:36:53,270 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:36:53,270 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:36:53,270 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:36:53,271 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:36:53,271 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:36:53,271 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:36:53,271 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:36:53,271 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 -> e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f [2025-01-09 09:36:53,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:36:53,546 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:36:53,549 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:36:53,550 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:36:53,551 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:36:53,552 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-01-09 09:36:54,737 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d20ed77b/f9904fe83ddc4a49b1fc2e6d370d6305/FLAGbc0463c0d [2025-01-09 09:36:55,011 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:36:55,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-01-09 09:36:55,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d20ed77b/f9904fe83ddc4a49b1fc2e6d370d6305/FLAGbc0463c0d [2025-01-09 09:36:55,035 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d20ed77b/f9904fe83ddc4a49b1fc2e6d370d6305 [2025-01-09 09:36:55,037 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:36:55,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:36:55,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:36:55,040 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:36:55,043 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:36:55,043 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,044 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1111a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55, skipping insertion in model container [2025-01-09 09:36:55,044 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:36:55,171 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2025-01-09 09:36:55,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:36:55,223 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:36:55,233 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2025-01-09 09:36:55,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:36:55,270 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:36:55,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55 WrapperNode [2025-01-09 09:36:55,273 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:36:55,274 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:36:55,274 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:36:55,274 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:36:55,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,292 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,314 INFO L138 Inliner]: procedures = 26, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 229 [2025-01-09 09:36:55,314 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:36:55,315 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:36:55,315 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:36:55,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:36:55,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,324 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,345 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 09:36:55,346 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,346 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,359 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,360 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,363 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,372 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:36:55,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:36:55,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:36:55,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:36:55,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (1/1) ... [2025-01-09 09:36:55,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:36:55,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:36:55,406 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 09:36:55,411 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 09:36:55,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:36:55,425 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:36:55,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:36:55,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:36:55,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:36:55,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:36:55,496 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:36:55,498 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:36:55,901 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-01-09 09:36:55,901 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:36:55,914 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:36:55,916 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:36:55,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:55 BoogieIcfgContainer [2025-01-09 09:36:55,917 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:36:55,920 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:36:55,920 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:36:55,924 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:36:55,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:36:55" (1/3) ... [2025-01-09 09:36:55,925 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7556e362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:55, skipping insertion in model container [2025-01-09 09:36:55,925 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:55" (2/3) ... [2025-01-09 09:36:55,926 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7556e362 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:55, skipping insertion in model container [2025-01-09 09:36:55,926 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:55" (3/3) ... [2025-01-09 09:36:55,927 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-01-09 09:36:55,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:36:55,940 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i that has 2 procedures, 100 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:36:55,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:36:56,000 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;@2578a6d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:36:56,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:36:56,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 09:36:56,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 09:36:56,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:36:56,017 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:36:56,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:36:56,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:36:56,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2044706555, now seen corresponding path program 1 times [2025-01-09 09:36:56,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:36:56,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598252141] [2025-01-09 09:36:56,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:36:56,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:36:56,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 09:36:56,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 09:36:56,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:36:56,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:36:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 09:36:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:36:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598252141] [2025-01-09 09:36:56,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598252141] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:36:56,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615838648] [2025-01-09 09:36:56,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:36:56,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:36:56,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:36:56,355 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 09:36:56,356 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 09:36:56,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 09:36:56,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 09:36:56,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:36:56,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:36:56,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:36:56,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:36:56,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 2048 trivial. 0 not checked. [2025-01-09 09:36:56,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:36:56,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615838648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:36:56,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:36:56,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:36:56,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452174788] [2025-01-09 09:36:56,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:36:56,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:36:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:36:56,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:36:56,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:36:56,597 INFO L87 Difference]: Start difference. First operand has 100 states, 64 states have (on average 1.375) internal successors, (88), 65 states have internal predecessors, (88), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 09:36:56,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:36:56,618 INFO L93 Difference]: Finished difference Result 194 states and 336 transitions. [2025-01-09 09:36:56,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:36:56,620 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) Word has length 208 [2025-01-09 09:36:56,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:36:56,625 INFO L225 Difference]: With dead ends: 194 [2025-01-09 09:36:56,625 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 09:36:56,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 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 09:36:56,630 INFO L435 NwaCegarLoop]: 149 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, 149 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 09:36:56,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:36:56,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 09:36:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 09:36:56,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3387096774193548) internal successors, (83), 62 states have internal predecessors, (83), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 09:36:56,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 149 transitions. [2025-01-09 09:36:56,666 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 149 transitions. Word has length 208 [2025-01-09 09:36:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:36:56,667 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 149 transitions. [2025-01-09 09:36:56,667 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, (33), 2 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 09:36:56,667 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 149 transitions. [2025-01-09 09:36:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 09:36:56,670 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:36:56,670 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:36:56,677 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 09:36:56,871 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 09:36:56,871 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:36:56,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:36:56,872 INFO L85 PathProgramCache]: Analyzing trace with hash -681289593, now seen corresponding path program 1 times [2025-01-09 09:36:56,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:36:56,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351268796] [2025-01-09 09:36:56,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:36:56,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:36:56,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 09:36:56,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 09:36:56,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:36:56,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:36:57,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 09:36:57,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:36:57,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351268796] [2025-01-09 09:36:57,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351268796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:36:57,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:36:57,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:36:57,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845039248] [2025-01-09 09:36:57,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:36:57,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:36:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:36:57,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:36:57,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:36:57,276 INFO L87 Difference]: Start difference. First operand 97 states and 149 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:36:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:36:57,311 INFO L93 Difference]: Finished difference Result 191 states and 295 transitions. [2025-01-09 09:36:57,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:36:57,313 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-01-09 09:36:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:36:57,315 INFO L225 Difference]: With dead ends: 191 [2025-01-09 09:36:57,315 INFO L226 Difference]: Without dead ends: 97 [2025-01-09 09:36:57,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 09:36:57,316 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 146 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:36:57,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:36:57,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-01-09 09:36:57,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-01-09 09:36:57,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 62 states have internal predecessors, (82), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 09:36:57,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 148 transitions. [2025-01-09 09:36:57,330 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 148 transitions. Word has length 208 [2025-01-09 09:36:57,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:36:57,332 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 148 transitions. [2025-01-09 09:36:57,332 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:36:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 148 transitions. [2025-01-09 09:36:57,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 09:36:57,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:36:57,337 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:36:57,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:36:57,339 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:36:57,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:36:57,340 INFO L85 PathProgramCache]: Analyzing trace with hash -423124155, now seen corresponding path program 1 times [2025-01-09 09:36:57,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:36:57,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122177482] [2025-01-09 09:36:57,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:36:57,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:36:57,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 09:36:57,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 09:36:57,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:36:57,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:36:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 09:36:59,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:36:59,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122177482] [2025-01-09 09:36:59,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122177482] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:36:59,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:36:59,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:36:59,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218533531] [2025-01-09 09:36:59,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:36:59,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:36:59,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:36:59,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:36:59,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:36:59,899 INFO L87 Difference]: Start difference. First operand 97 states and 148 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:00,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:00,645 INFO L93 Difference]: Finished difference Result 226 states and 339 transitions. [2025-01-09 09:37:00,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:37:00,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 208 [2025-01-09 09:37:00,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:00,648 INFO L225 Difference]: With dead ends: 226 [2025-01-09 09:37:00,648 INFO L226 Difference]: Without dead ends: 132 [2025-01-09 09:37:00,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:37:00,649 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 41 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:00,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 609 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:37:00,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-01-09 09:37:00,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2025-01-09 09:37:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 89 states have (on average 1.3146067415730338) internal successors, (117), 90 states have internal predecessors, (117), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-01-09 09:37:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2025-01-09 09:37:00,662 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 208 [2025-01-09 09:37:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:00,663 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2025-01-09 09:37:00,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2025-01-09 09:37:00,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 09:37:00,665 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:00,665 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:00,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:37:00,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:00,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:00,666 INFO L85 PathProgramCache]: Analyzing trace with hash -688626758, now seen corresponding path program 1 times [2025-01-09 09:37:00,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:00,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197224446] [2025-01-09 09:37:00,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:00,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:00,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 09:37:00,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 09:37:00,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:00,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 09:37:01,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:01,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197224446] [2025-01-09 09:37:01,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197224446] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:01,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:01,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:37:01,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231083690] [2025-01-09 09:37:01,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:01,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:37:01,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:01,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:37:01,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:37:01,464 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:01,741 INFO L93 Difference]: Finished difference Result 287 states and 420 transitions. [2025-01-09 09:37:01,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:37:01,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-01-09 09:37:01,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:01,743 INFO L225 Difference]: With dead ends: 287 [2025-01-09 09:37:01,743 INFO L226 Difference]: Without dead ends: 161 [2025-01-09 09:37:01,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:37:01,744 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 42 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:01,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 690 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 09:37:01,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-01-09 09:37:01,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2025-01-09 09:37:01,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 115 states have (on average 1.3130434782608695) internal successors, (151), 117 states have internal predecessors, (151), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:37:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2025-01-09 09:37:01,765 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 209 [2025-01-09 09:37:01,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:01,765 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2025-01-09 09:37:01,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:01,765 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2025-01-09 09:37:01,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 09:37:01,767 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:01,767 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:01,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:37:01,767 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:01,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:01,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1699744008, now seen corresponding path program 1 times [2025-01-09 09:37:01,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:01,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008328300] [2025-01-09 09:37:01,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:01,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:01,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 09:37:01,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 09:37:01,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:01,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:02,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 09:37:02,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:02,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008328300] [2025-01-09 09:37:02,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008328300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:02,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:02,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 09:37:02,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334992860] [2025-01-09 09:37:02,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:02,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 09:37:02,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:02,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 09:37:02,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 09:37:02,271 INFO L87 Difference]: Start difference. First operand 158 states and 229 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:02,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:02,445 INFO L93 Difference]: Finished difference Result 329 states and 470 transitions. [2025-01-09 09:37:02,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 09:37:02,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 209 [2025-01-09 09:37:02,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:02,448 INFO L225 Difference]: With dead ends: 329 [2025-01-09 09:37:02,448 INFO L226 Difference]: Without dead ends: 174 [2025-01-09 09:37:02,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:37:02,449 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 72 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:02,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 563 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:37:02,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-01-09 09:37:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 141. [2025-01-09 09:37:02,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 97 states have (on average 1.2783505154639174) internal successors, (124), 99 states have internal predecessors, (124), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:37:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 202 transitions. [2025-01-09 09:37:02,461 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 202 transitions. Word has length 209 [2025-01-09 09:37:02,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:02,461 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 202 transitions. [2025-01-09 09:37:02,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:02,461 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 202 transitions. [2025-01-09 09:37:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 09:37:02,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:02,463 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:02,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:37:02,463 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:02,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:02,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1190416000, now seen corresponding path program 1 times [2025-01-09 09:37:02,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:02,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786494054] [2025-01-09 09:37:02,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:02,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:02,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 09:37:02,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 09:37:02,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:02,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:05,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 09:37:05,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:05,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786494054] [2025-01-09 09:37:05,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786494054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:05,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:05,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:37:05,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740059702] [2025-01-09 09:37:05,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:05,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:37:05,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:05,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:37:05,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:37:05,675 INFO L87 Difference]: Start difference. First operand 141 states and 202 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:06,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:06,341 INFO L93 Difference]: Finished difference Result 408 states and 576 transitions. [2025-01-09 09:37:06,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:37:06,342 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2025-01-09 09:37:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:06,344 INFO L225 Difference]: With dead ends: 408 [2025-01-09 09:37:06,344 INFO L226 Difference]: Without dead ends: 278 [2025-01-09 09:37:06,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-01-09 09:37:06,345 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 123 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:06,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 727 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 09:37:06,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-01-09 09:37:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 172. [2025-01-09 09:37:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 128 states have (on average 1.3046875) internal successors, (167), 130 states have internal predecessors, (167), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:37:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 245 transitions. [2025-01-09 09:37:06,360 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 245 transitions. Word has length 210 [2025-01-09 09:37:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:06,360 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 245 transitions. [2025-01-09 09:37:06,360 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:06,361 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 245 transitions. [2025-01-09 09:37:06,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 09:37:06,362 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:06,362 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:06,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:37:06,362 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:06,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:06,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1891480578, now seen corresponding path program 1 times [2025-01-09 09:37:06,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:06,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134816383] [2025-01-09 09:37:06,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:06,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:06,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 09:37:06,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 09:37:06,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:06,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 09:37:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:08,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134816383] [2025-01-09 09:37:08,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134816383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:08,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:08,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 09:37:08,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205356080] [2025-01-09 09:37:08,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:08,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 09:37:08,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:08,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 09:37:08,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 09:37:08,286 INFO L87 Difference]: Start difference. First operand 172 states and 245 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:08,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:08,700 INFO L93 Difference]: Finished difference Result 379 states and 539 transitions. [2025-01-09 09:37:08,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 09:37:08,700 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 210 [2025-01-09 09:37:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:08,702 INFO L225 Difference]: With dead ends: 379 [2025-01-09 09:37:08,703 INFO L226 Difference]: Without dead ends: 218 [2025-01-09 09:37:08,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-09 09:37:08,704 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 80 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:08,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 737 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 09:37:08,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-01-09 09:37:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 172. [2025-01-09 09:37:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 128 states have (on average 1.3046875) internal successors, (167), 130 states have internal predecessors, (167), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:37:08,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 245 transitions. [2025-01-09 09:37:08,717 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 245 transitions. Word has length 210 [2025-01-09 09:37:08,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:08,718 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 245 transitions. [2025-01-09 09:37:08,718 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, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:08,718 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 245 transitions. [2025-01-09 09:37:08,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 09:37:08,720 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:08,720 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:08,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:37:08,720 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:08,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:08,721 INFO L85 PathProgramCache]: Analyzing trace with hash -968149895, now seen corresponding path program 1 times [2025-01-09 09:37:08,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:08,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632854069] [2025-01-09 09:37:08,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:08,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:08,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 09:37:08,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 09:37:08,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:08,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:08,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 09:37:08,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:08,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632854069] [2025-01-09 09:37:08,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632854069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:08,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:08,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:37:08,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438916961] [2025-01-09 09:37:08,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:08,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:37:08,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:08,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:37:08,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:37:08,777 INFO L87 Difference]: Start difference. First operand 172 states and 245 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:08,858 INFO L93 Difference]: Finished difference Result 400 states and 566 transitions. [2025-01-09 09:37:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:37:08,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-01-09 09:37:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:08,860 INFO L225 Difference]: With dead ends: 400 [2025-01-09 09:37:08,860 INFO L226 Difference]: Without dead ends: 239 [2025-01-09 09:37:08,861 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 09:37:08,861 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 39 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:08,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 239 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:37:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-01-09 09:37:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 208. [2025-01-09 09:37:08,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 164 states have (on average 1.3109756097560976) internal successors, (215), 166 states have internal predecessors, (215), 39 states have call successors, (39), 4 states have call predecessors, (39), 4 states have return successors, (39), 37 states have call predecessors, (39), 39 states have call successors, (39) [2025-01-09 09:37:08,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 293 transitions. [2025-01-09 09:37:08,874 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 293 transitions. Word has length 211 [2025-01-09 09:37:08,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:08,874 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 293 transitions. [2025-01-09 09:37:08,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:08,875 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 293 transitions. [2025-01-09 09:37:08,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 09:37:08,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:08,876 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:08,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:37:08,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:08,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:08,877 INFO L85 PathProgramCache]: Analyzing trace with hash 665255191, now seen corresponding path program 1 times [2025-01-09 09:37:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:08,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108910887] [2025-01-09 09:37:08,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:08,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 09:37:08,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 09:37:08,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:08,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:09,020 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 09:37:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:09,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108910887] [2025-01-09 09:37:09,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108910887] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:09,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:09,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:37:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189445024] [2025-01-09 09:37:09,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:09,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:37:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:09,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:37:09,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:37:09,022 INFO L87 Difference]: Start difference. First operand 208 states and 293 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:09,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:09,184 INFO L93 Difference]: Finished difference Result 581 states and 821 transitions. [2025-01-09 09:37:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:37:09,185 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-01-09 09:37:09,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:09,187 INFO L225 Difference]: With dead ends: 581 [2025-01-09 09:37:09,187 INFO L226 Difference]: Without dead ends: 376 [2025-01-09 09:37:09,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 09:37:09,188 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 102 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 493 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:09,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 493 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:37:09,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-01-09 09:37:09,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 276. [2025-01-09 09:37:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 196 states have (on average 1.2755102040816326) internal successors, (250), 198 states have internal predecessors, (250), 72 states have call successors, (72), 7 states have call predecessors, (72), 7 states have return successors, (72), 70 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 09:37:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 394 transitions. [2025-01-09 09:37:09,215 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 394 transitions. Word has length 211 [2025-01-09 09:37:09,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:09,216 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 394 transitions. [2025-01-09 09:37:09,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:09,216 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 394 transitions. [2025-01-09 09:37:09,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-09 09:37:09,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:09,217 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:09,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 09:37:09,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1298063557, now seen corresponding path program 1 times [2025-01-09 09:37:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:09,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104870642] [2025-01-09 09:37:09,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:09,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:09,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-09 09:37:09,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-09 09:37:09,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:09,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:09,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 09:37:09,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:37:09,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104870642] [2025-01-09 09:37:09,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104870642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:09,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:09,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:37:09,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908392122] [2025-01-09 09:37:09,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:09,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:37:09,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:37:09,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:37:09,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:37:09,278 INFO L87 Difference]: Start difference. First operand 276 states and 394 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:09,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:09,387 INFO L93 Difference]: Finished difference Result 508 states and 714 transitions. [2025-01-09 09:37:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:37:09,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 211 [2025-01-09 09:37:09,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:09,391 INFO L225 Difference]: With dead ends: 508 [2025-01-09 09:37:09,391 INFO L226 Difference]: Without dead ends: 303 [2025-01-09 09:37:09,392 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 09:37:09,392 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 46 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:09,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 259 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:37:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-01-09 09:37:09,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 261. [2025-01-09 09:37:09,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 183 states have (on average 1.2622950819672132) internal successors, (231), 184 states have internal predecessors, (231), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2025-01-09 09:37:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 371 transitions. [2025-01-09 09:37:09,419 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 371 transitions. Word has length 211 [2025-01-09 09:37:09,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:09,420 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 371 transitions. [2025-01-09 09:37:09,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:09,420 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 371 transitions. [2025-01-09 09:37:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-01-09 09:37:09,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:09,422 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:09,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 09:37:09,422 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:09,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:09,422 INFO L85 PathProgramCache]: Analyzing trace with hash 694325179, now seen corresponding path program 1 times [2025-01-09 09:37:09,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:37:09,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666304065] [2025-01-09 09:37:09,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:09,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:37:09,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 09:37:09,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 09:37:09,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:09,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:37:09,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [906583559] [2025-01-09 09:37:09,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:09,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:37:09,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:37:09,503 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 09:37:09,509 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 09:37:09,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 09:37:09,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 09:37:09,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:09,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:37:09,609 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 09:37:09,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-01-09 09:37:09,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-01-09 09:37:09,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:09,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 09:37:09,803 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 09:37:09,804 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 09:37:09,804 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 09:37:09,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 09:37:10,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:37:10,010 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:37:10,134 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 09:37:10,141 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:37:10 BoogieIcfgContainer [2025-01-09 09:37:10,141 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 09:37:10,142 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 09:37:10,142 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 09:37:10,142 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 09:37:10,143 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:55" (3/4) ... [2025-01-09 09:37:10,145 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 09:37:10,146 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 09:37:10,147 INFO L158 Benchmark]: Toolchain (without parser) took 15107.58ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 104.9MB in the beginning and 297.4MB in the end (delta: -192.4MB). Peak memory consumption was 282.3MB. Max. memory is 16.1GB. [2025-01-09 09:37:10,147 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:37:10,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.45ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 89.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 09:37:10,148 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.57ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 86.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 09:37:10,148 INFO L158 Benchmark]: Boogie Preprocessor took 57.69ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 81.5MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:37:10,148 INFO L158 Benchmark]: RCFGBuilder took 543.74ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 54.2MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 09:37:10,148 INFO L158 Benchmark]: TraceAbstraction took 14221.86ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 53.0MB in the beginning and 297.5MB in the end (delta: -244.5MB). Peak memory consumption was 223.6MB. Max. memory is 16.1GB. [2025-01-09 09:37:10,148 INFO L158 Benchmark]: Witness Printer took 3.83ms. Allocated memory is still 612.4MB. Free memory was 297.5MB in the beginning and 297.4MB in the end (delta: 193.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 09:37:10,150 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 127.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.45ms. Allocated memory is still 142.6MB. Free memory was 104.9MB in the beginning and 89.8MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.57ms. Allocated memory is still 142.6MB. Free memory was 89.8MB in the beginning and 86.5MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.69ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 81.5MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 543.74ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 54.2MB in the end (delta: 27.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14221.86ms. Allocated memory was 142.6MB in the beginning and 612.4MB in the end (delta: 469.8MB). Free memory was 53.0MB in the beginning and 297.5MB in the end (delta: -244.5MB). Peak memory consumption was 223.6MB. Max. memory is 16.1GB. * Witness Printer took 3.83ms. Allocated memory is still 612.4MB. Free memory was 297.5MB in the beginning and 297.4MB in the end (delta: 193.9kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 158, overapproximation of someBinaryDOUBLEComparisonOperation at line 135. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] signed long int var_1_22 = 0; [L42] signed long int var_1_23 = 100; [L43] signed long int var_1_24 = 2; [L44] unsigned char var_1_25 = 1; [L45] unsigned char var_1_26 = 1; [L46] unsigned char var_1_27 = 0; [L47] unsigned char var_1_28 = 1; [L48] unsigned char var_1_29 = 1; [L49] float var_1_30 = 2.5; [L50] float var_1_31 = 15.25; [L51] unsigned long int var_1_32 = 256; [L52] unsigned long int var_1_33 = 100; [L53] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L162] isInitial = 1 [L163] FCALL initially() [L165] CALL updateLastVariables() [L155] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L165] RET updateLastVariables() [L166] CALL updateVariables() [L104] var_1_3 = __VERIFIER_nondet_char() [L105] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L105] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L106] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L106] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L107] var_1_4 = __VERIFIER_nondet_char() [L108] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L108] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L109] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L109] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L110] var_1_5 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L111] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L112] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L113] var_1_7 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L114] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L115] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L116] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L116] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-4, var_1_9=50] [L117] var_1_8 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L118] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L119] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L119] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L120] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L120] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L121] var_1_10 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L122] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L123] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L123] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L124] var_1_11 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L125] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L126] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L126] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L127] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L127] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L128] var_1_16 = __VERIFIER_nondet_long() [L129] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L129] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L130] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L130] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L131] var_1_17 = __VERIFIER_nondet_ushort() [L132] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L132] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L133] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L133] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L134] var_1_21 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L135] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=100, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L136] var_1_23 = __VERIFIER_nondet_long() [L137] CALL assume_abort_if_not(var_1_23 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L137] RET assume_abort_if_not(var_1_23 >= -2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L138] CALL assume_abort_if_not(var_1_23 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L138] RET assume_abort_if_not(var_1_23 <= 2147483646) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=1, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L139] var_1_25 = __VERIFIER_nondet_uchar() [L140] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L140] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L141] CALL assume_abort_if_not(var_1_25 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L141] RET assume_abort_if_not(var_1_25 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=1, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L142] var_1_26 = __VERIFIER_nondet_uchar() [L143] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L143] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L144] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L144] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L145] var_1_29 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L146] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L147] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L147] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_31=61/4, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L148] var_1_31 = __VERIFIER_nondet_float() [L149] CALL assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L149] RET assume_abort_if_not((var_1_31 >= -922337.2036854765600e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854765600e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=100, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L150] var_1_33 = __VERIFIER_nondet_ulong() [L151] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L151] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L152] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L152] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=0, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L166] RET updateVariables() [L167] CALL step() [L57] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L58] COND FALSE !(var_1_25 && var_1_26) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=5/2, var_1_32=256, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L63] var_1_27 = 0 [L64] var_1_28 = var_1_29 [L65] var_1_30 = var_1_31 [L66] var_1_32 = var_1_33 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L67] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=50] [L67] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L72] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L74] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L74] signed long int stepLocal_3 = (var_1_4 + var_1_9) & var_1_7; [L75] COND TRUE stepLocal_3 <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L76] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L80] signed long int stepLocal_1 = -4; [L81] signed long int stepLocal_0 = -16; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_1=-4, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L82] COND FALSE !(stepLocal_1 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L87] var_1_18 = var_1_17 [L88] var_1_19 = 0 [L89] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L90] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=121, var_1_12=10, var_1_13=16, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L93] COND TRUE var_1_3 <= var_1_1 [L94] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L98] unsigned long int stepLocal_2 = var_1_18; VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, stepLocal_2=32768, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=16, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L99] COND TRUE (~ var_1_3) < stepLocal_2 [L100] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, stepLocal_0=-16, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=-5, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L167] RET step() [L168] CALL, EXPR property() [L158] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=-5, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L158] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=-5, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L158] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=-5, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L158] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=-5, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L158] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=-5, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L158] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=-5, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L158-L159] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L168] RET, EXPR property() [L168] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=-5, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=127, var_1_11=121, var_1_12=0, var_1_13=-5, var_1_15=185, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=3, var_1_21=3, var_1_22=-2147483647, var_1_23=-2147483647, var_1_24=2, var_1_25=-255, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=1, var_1_30=2, var_1_31=2, var_1_32=0, var_1_33=0, var_1_3=-62, var_1_4=0, var_1_5=7, var_1_6=50, var_1_7=3, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.0s, OverallIterations: 11, TraceHistogramMax: 33, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 691 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 691 mSDsluCounter, 4611 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3183 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1293 IncrementalHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 1428 mSDtfsCounter, 1293 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=276occurred in iteration=9, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 364 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 2727 NumberOfCodeBlocks, 2727 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2292 ConstructedInterpolants, 0 QuantifiedInterpolants, 6834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 23168/23232 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 09:37:10,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.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 e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:37:12,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:37:12,410 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 09:37:12,419 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:37:12,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:37:12,440 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:37:12,442 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:37:12,442 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:37:12,443 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:37:12,443 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:37:12,443 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:37:12,443 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:37:12,443 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:37:12,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:37:12,443 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:37:12,443 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:37:12,443 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:37:12,443 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:37:12,443 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:37:12,443 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:37:12,444 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:37:12,444 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:37:12,444 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:37:12,445 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:37:12,445 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:37:12,445 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:37:12,445 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:37:12,445 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:37:12,445 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 09:37:12,445 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 09:37:12,445 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:37:12,445 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:37:12,445 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:37:12,445 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:37:12,445 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 -> e1856ea979a515682843ea065e3d41725035a700c47302906a364d3e5d5e532f [2025-01-09 09:37:12,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:37:12,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:37:12,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:37:12,739 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:37:12,740 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:37:12,740 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-01-09 09:37:14,036 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/729a5a1d2/4fda3af1bb334f6bb7a57ffddda98a06/FLAG9f778a6ca [2025-01-09 09:37:14,240 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:37:14,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-01-09 09:37:14,248 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/729a5a1d2/4fda3af1bb334f6bb7a57ffddda98a06/FLAG9f778a6ca [2025-01-09 09:37:14,261 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/729a5a1d2/4fda3af1bb334f6bb7a57ffddda98a06 [2025-01-09 09:37:14,264 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:37:14,265 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:37:14,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:37:14,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:37:14,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:37:14,270 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,270 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b6830ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14, skipping insertion in model container [2025-01-09 09:37:14,271 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:37:14,387 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2025-01-09 09:37:14,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:37:14,465 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:37:14,473 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-84.i[915,928] [2025-01-09 09:37:14,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:37:14,522 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:37:14,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14 WrapperNode [2025-01-09 09:37:14,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:37:14,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:37:14,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:37:14,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:37:14,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,539 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,564 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2025-01-09 09:37:14,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:37:14,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:37:14,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:37:14,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:37:14,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,580 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,597 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 09:37:14,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,597 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,607 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,618 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,619 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,624 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:37:14,625 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:37:14,625 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:37:14,625 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:37:14,626 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (1/1) ... [2025-01-09 09:37:14,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:37:14,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:37:14,651 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 09:37:14,654 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 09:37:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:37:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 09:37:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:37:14,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:37:14,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:37:14,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:37:14,745 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:37:14,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:37:15,063 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-01-09 09:37:15,063 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:37:15,070 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:37:15,070 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:37:15,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:37:15 BoogieIcfgContainer [2025-01-09 09:37:15,070 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:37:15,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:37:15,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:37:15,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:37:15,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:37:14" (1/3) ... [2025-01-09 09:37:15,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298381cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:37:15, skipping insertion in model container [2025-01-09 09:37:15,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:37:14" (2/3) ... [2025-01-09 09:37:15,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@298381cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:37:15, skipping insertion in model container [2025-01-09 09:37:15,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:37:15" (3/3) ... [2025-01-09 09:37:15,077 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i [2025-01-09 09:37:15,087 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:37:15,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-84.i that has 2 procedures, 82 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:37:15,137 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:37:15,145 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;@31eb7fcb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:37:15,145 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:37:15,148 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 09:37:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 09:37:15,156 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:15,157 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:15,157 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:15,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:15,161 INFO L85 PathProgramCache]: Analyzing trace with hash 671256837, now seen corresponding path program 1 times [2025-01-09 09:37:15,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:37:15,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1005416211] [2025-01-09 09:37:15,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:15,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:37:15,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:37:15,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:37:15,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-01-09 09:37:15,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 09:37:15,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 09:37:15,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:15,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:15,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:37:15,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:37:15,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 764 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-01-09 09:37:15,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:37:15,453 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:37:15,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1005416211] [2025-01-09 09:37:15,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1005416211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:15,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:15,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 09:37:15,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451168972] [2025-01-09 09:37:15,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:15,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:37:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:37:15,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:37:15,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:37:15,482 INFO L87 Difference]: Start difference. First operand has 82 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 47 states have internal predecessors, (60), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 09:37:15,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:15,510 INFO L93 Difference]: Finished difference Result 158 states and 280 transitions. [2025-01-09 09:37:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:37:15,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 202 [2025-01-09 09:37:15,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:15,515 INFO L225 Difference]: With dead ends: 158 [2025-01-09 09:37:15,515 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 09:37:15,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 201 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 09:37:15,521 INFO L435 NwaCegarLoop]: 121 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, 121 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 09:37:15,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:37:15,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 09:37:15,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-09 09:37:15,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 09:37:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 121 transitions. [2025-01-09 09:37:15,559 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 121 transitions. Word has length 202 [2025-01-09 09:37:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:15,561 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 121 transitions. [2025-01-09 09:37:15,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 09:37:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 121 transitions. [2025-01-09 09:37:15,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 09:37:15,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:15,565 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:15,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 09:37:15,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:37:15,767 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:15,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:15,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1711731207, now seen corresponding path program 1 times [2025-01-09 09:37:15,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:37:15,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111484240] [2025-01-09 09:37:15,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:15,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:37:15,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:37:15,773 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:37:15,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-01-09 09:37:15,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 09:37:15,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 09:37:15,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:15,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:15,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 09:37:15,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:37:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2112 trivial. 0 not checked. [2025-01-09 09:37:16,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:37:16,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 09:37:16,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111484240] [2025-01-09 09:37:16,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111484240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:37:16,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:37:16,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:37:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542567321] [2025-01-09 09:37:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:37:16,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:37:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 09:37:16,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:37:16,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:37:16,033 INFO L87 Difference]: Start difference. First operand 79 states and 121 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:37:16,101 INFO L93 Difference]: Finished difference Result 155 states and 239 transitions. [2025-01-09 09:37:16,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:37:16,112 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) Word has length 202 [2025-01-09 09:37:16,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:37:16,114 INFO L225 Difference]: With dead ends: 155 [2025-01-09 09:37:16,114 INFO L226 Difference]: Without dead ends: 79 [2025-01-09 09:37:16,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 200 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 09:37:16,115 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 118 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:37:16,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:37:16,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-01-09 09:37:16,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-01-09 09:37:16,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 33 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-01-09 09:37:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2025-01-09 09:37:16,128 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 202 [2025-01-09 09:37:16,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:37:16,129 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2025-01-09 09:37:16,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (33), 1 states have call predecessors, (33), 1 states have return successors, (33), 1 states have call predecessors, (33), 1 states have call successors, (33) [2025-01-09 09:37:16,130 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2025-01-09 09:37:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-01-09 09:37:16,131 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:37:16,131 INFO L218 NwaCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:37:16,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2025-01-09 09:37:16,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:37:16,334 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:37:16,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:37:16,335 INFO L85 PathProgramCache]: Analyzing trace with hash 902384581, now seen corresponding path program 1 times [2025-01-09 09:37:16,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 09:37:16,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977688905] [2025-01-09 09:37:16,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:37:16,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 09:37:16,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 09:37:16,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-01-09 09:37:16,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-01-09 09:37:16,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 09:37:16,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 09:37:16,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:37:16,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:37:16,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-01-09 09:37:16,572 INFO L279 TraceCheckSpWp]: Computing forward predicates...